登录
首页 » 数据结构 » 该程序能实现的功能,若活动图有回路则无法计算出关键路径,即解决了判断工程的可行性问题。通过对工程活动的输入,可以建立任意的AOE网进行判断。对于输入的网,可以计...

该程序能实现的功能,若活动图有回路则无法计算出关键路径,即解决了判断工程的可行性问题。通过对工程活动的输入,可以建立任意的AOE网进行判断。对于输入的网,可以计...

于 2022-02-28 发布 文件大小:1.69 kB
0 165
下载积分: 2 下载次数: 1

代码说明:

该程序能实现的功能,若活动图有回路则无法计算出关键路径,即解决了判断工程的可行性问题。通过对工程活动的输入,可以建立任意的AOE网进行判断。对于输入的网,可以计算出每个活动的最早开始时间,最迟开始时间和全工程可以完成的最早时间,并找出关键路径和关键活动。-the program can achieve the functional, if a circuit map activities can not be calculated critical path, that is a judgment to resolve the feasibility of the project. Right through the importation of construction activities, we can establish arbitrary judgment AOE network. The network for the importation can be calculated for each of the earliest start time, the latest starting time and the entire project will be completed in the first time, and identify key and critical path activities.

下载说明:请别用迅雷下载,失败请重下,重下不扣分!

发表评论

0 个回复

  • 哈弗曼编码器,含有完整源码。文件的输入与输出。
    哈弗曼编码器,含有完整源码。文件的输入与输出。-Havermann encoder, includes full source code. File input and output.
    2022-08-24 01:35:39下载
    积分:1
  • 售票处的服务系统
    利用链表的结构,定义了航班信息链和乘客资料链,通过对链表的初始化、插入、删除等操作实现航线及乘客资料的录入、修改、办理退订票等功能。
    2022-07-16 12:19:26下载
    积分:1
  • 索引顺序表查找,索引顺序查找即分块查找,是将顺序表分成诺干块。...
    索引顺序表查找,索引顺序查找即分块查找,是将顺序表分成诺干块。-Indexed sequential table lookup, the index in order to find that the search block is to the order of the table is divided into Nokan blocks.
    2022-01-26 01:40:51下载
    积分:1
  • 课程管理系统 适用于教师
    课程管理系统 适用于教师 -course management system applicable to teachers
    2022-01-25 14:30:21下载
    积分:1
  • /* Maze * Starting point is m[0][0], need to find a path go to m[9][9]. 0 means...
    迷宫算法(maze) /* Maze * Starting point is m[0][0], need to find a path go to m[9][9]. 0 means OK, * 1 means cannot go there, boundary is 0 and 9, cannot go beyond boundary. * Each step can be made horizontally or vertically for one more grid (diagonal * jump is not allowed). * Your program should print a series of grid coordinates that start from m[0][0] * and go to m[9][9] * Hint: No need to find the shortest path, only need to find one path that gets * you to desitination. */ -/* Maze * Starting point is m[0][0], need to find a path go to m[9][9]. 0 means OK, * 1 means cannot go there, boundary is 0 and 9, cannot go beyond boundary. * Each step can be made horizontally or vertically for one more grid (diagonal * jump is not allowed). * Your program should print a series of grid coordinates that start from m[0][0] * and go to m[9][9] * Hint: No need to find the shortest path, only need to find one path that gets * you to desitination.
    2022-08-08 06:28:42下载
    积分:1
  • PHP的beginers
    亲爱的同学们是打印指令和数据库操作和不同的行动,在 php 编程
    2022-10-31 23:05:02下载
    积分:1
  • 帐户软件
    这个项目是由帐户管理系统组成。雇员的数据给数据库。usernme 和密码用于开放系统。
    2022-03-07 17:02:35下载
    积分:1
  • 女王
    皇后控制问题 皇后控制问题-Queen
    2022-08-12 07:40:59下载
    积分:1
  • 网络求职招聘人才网站系统正式版(源码),MS SQL库,附安装视频,无功能限制完全版...
    网络求职招聘人才网站系统正式版(源码),MS SQL数据库,附安装视频,无功能限制完全版-Job recruitment Web site an official version of the system (source), MS SQL database, with the installation of video, full version without functional limitation
    2022-12-31 18:55:13下载
    积分:1
  • 关系型库 Postgresql 6.5.2
    关系型数据库 Postgresql 6.5.2- Relations database Postgresql 6.5.2
    2023-03-22 01:15:03下载
    积分:1
  • 696518资源总数
  • 106161会员总数
  • 5今日下载