文件名称:02-M
-
所属分类:
- 标签属性:
- 上传时间:2012-11-16
-
文件大小:1.53kb
-
已下载:0次
-
提 供 者:
-
相关连接:无下载说明:别用迅雷下载,失败请重下,重下不扣分!
介绍说明--下载内容来自于网络,使用问题请自行百度
问题描述:设计一个程序求出完成整项工程至少需要多少时间以及整项工程中的关键活动。
基本要求:
(1)对一个描述工程的AOE网,应判断其是否能够顺利进行。
(2)若该工程能顺利进行,输出完成整项工程至少需要多少时间,以及每一个关键活动所依附的两个顶点、最早发生时间、最迟发生时间。-Problem descr iption: Design a program to complete the whole project at least find the time required and the whole project is a key activity.
Basic requirements:
(1) a descr iption of the project AOE network, should determine whether it can proceed smoothly.
(2) If the project can proceed smoothly, the output to complete the whole project at least the number of times, and each of the key activities of the two vertices of attachment, the earliest time, the latest time of occurrence.
基本要求:
(1)对一个描述工程的AOE网,应判断其是否能够顺利进行。
(2)若该工程能顺利进行,输出完成整项工程至少需要多少时间,以及每一个关键活动所依附的两个顶点、最早发生时间、最迟发生时间。-Problem descr iption: Design a program to complete the whole project at least find the time required and the whole project is a key activity.
Basic requirements:
(1) a descr iption of the project AOE network, should determine whether it can proceed smoothly.
(2) If the project can proceed smoothly, the output to complete the whole project at least the number of times, and each of the key activities of the two vertices of attachment, the earliest time, the latest time of occurrence.
(系统自动生成,下载前可以参看下载内容)
下载文件列表
02-M.txt
1999-2046 搜珍网 All Rights Reserved.
本站作为网络服务提供者,仅为网络服务对象提供信息存储空间,仅对用户上载内容的表现方式做保护处理,对上载内容本身不做任何修改或编辑。
