| 求关键路径的一种方法 |
| |
| 引用本文： | 刘彦.求关键路径的一种方法[J].湘潭大学自然科学学报,1991,13(4):146-153. |
| |
| 作者姓名： | 刘彦 |
| |
| 作者单位： | 湘潭大学计算机科学系 |
| |
| 摘 要： | 从理论和实践出发给出了一种新的求关键路径的方法及实现它的算法.较经典方法简单,不改变机器空间与时间的数量级。
|
| 关 键 词： | 数据结构 算法 关键路径 有向图 算法分析 |
THE NEW METHOD FoR GETTING CRITICAL PATH |
| |
| Liu Yan.THE NEW METHOD FoR GETTING CRITICAL PATH[J].Natural Science Journal of Xiangtan University,1991,13(4):146-153. |
| |
| Authors: | Liu Yan |
| |
| Institution: | Department of Computer Science |
| |
| Abstract: | 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. |
| |
| Keywords: | data structrue algorithm criticalrath directional graph algorithm analyse |
| 本文献已被 CNKI 维普 等数据库收录！ |
