| 三种求关键路径算法的比较 |
| |
| 引用本文： | 史玉敏,赵庆祯. 三种求关键路径算法的比较[J]. 现代计算机, 2006, 0(2): 107-109 |
| |
| 作者姓名： | 史玉敏 赵庆祯 |
| |
| 作者单位： | 山东师范大学管理学院,济南250014 |
| |
| 摘 要： | 本文分别从算法复杂度、数据结构形式及实现的容易程度等几方面分析了三种求关键路径算法的优劣.
|
| 关 键 词： | 关键路径 算法 AOE-网 |
| 收稿时间： | 2005-11-16 |
| 修稿时间： | 2005-11-16 |
Research of Three Algorithms for Finding the Critical Paths |
| |
| SHI Yu-min,ZHAO Qing-zhen. Research of Three Algorithms for Finding the Critical Paths[J]. Modem Computer, 2006, 0(2): 107-109 |
| |
| Authors: | SHI Yu-min ZHAO Qing-zhen |
| |
| Affiliation: | Institute of Management, Shandong Normal University, Jinan 250014 China |
| |
| Abstract: | This text has analysed three algorithms for finding the critical paths from several respects separately, such as complexity of the algorithm, the structure form of the data and easy degree. |
| |
| Keywords: | Critical Paths Algorithm AOE-Network |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
