摘要
从理论和实践出发给出了一种新的求关键路径的方法及实现它的算法.较经典方法简单,不改变机器空间与时间的数量级。
This paper advances the new method for getting criticalpath in terms of theory and practice,and the algorithm for realizingthe method.The method is simpler than classical methods,at the sametime, the storage-capacity and run-time of the computer is saved withthe method.
出处
《湘潭大学自然科学学报》
CAS
CSCD
1991年第4期146-153,共8页
Natural Science Journal of Xiangtan University
关键词
关键路径
数据结构
算法
有向图
data structrue
algorithm
criticalrath
directional graph
algorithm analyse
