文件名称:cPMsuanf
-
所属分类:
- 标签属性:
- 上传时间:2012-11-16
-
文件大小:117.4kb
-
已下载:0次
-
提 供 者:
-
相关连接:无下载说明:别用迅雷下载,失败请重下,重下不扣分!
介绍说明--下载内容来自于网络,使用问题请自行百度
关键路径通常是在拓扑排序的基础上求得的。本文算法中设计了一些独特的数据结构,在算法运行的整个
过程中,求发点(源点)到收点(终点)的关键路径的过程(入栈、出栈等操作)实际只进行一遍,不需要进行拓扑排序,算法的时间
复杂度为O(n+e),较传统的算法效率更高-Critical path is usually calculated based on the topological sort of. This algorithm designed some unique data structure, algorithm running throughout the process, find the starting point (source) to the resumption point (end point) the critical path of the process (stack, the stack, etc. operations) actually only one set , does not require the topological sort algorithm time complexity is O (n+ e), the algorithm is more efficient than traditional
过程中,求发点(源点)到收点(终点)的关键路径的过程(入栈、出栈等操作)实际只进行一遍,不需要进行拓扑排序,算法的时间
复杂度为O(n+e),较传统的算法效率更高-Critical path is usually calculated based on the topological sort of. This algorithm designed some unique data structure, algorithm running throughout the process, find the starting point (source) to the resumption point (end point) the critical path of the process (stack, the stack, etc. operations) actually only one set , does not require the topological sort algorithm time complexity is O (n+ e), the algorithm is more efficient than traditional
相关搜索: 拓扑
(系统自动生成,下载前可以参看下载内容)
下载文件列表
求解关键路径的新算法.pdf
本网站为编程资源及源代码搜集、介绍的搜索网站,版权归原作者所有! 粤ICP备11031372号
1999-2046 搜珍网 All Rights Reserved.