| 关键路径求解的新算法 |
| |
| 引用本文： | 徐凤生,黄倩.关键路径求解的新算法[J].计算机应用,2004,24(12):108-109. |
| |
| 作者姓名： | 徐凤生 黄倩 |
| |
| 作者单位： | 1. 德州学院,计算机系,山东,德州,253023
2. 德州学院,基础部,山东,德州,253023 |
| |
| 摘 要： | 关键路径通常是在拓扑排序的基础上求得的。文中在按广度优先搜索基础上，提出了一种新的求解关键路径的算法，该算法采用图的十字链表结构形式，不需要进行拓扑排序，算法的时间复杂度为O(n e)，较传统的算法效率更高。
|
| 关 键 词： | 关键路径 算法 十字链表 广度优先搜索 |
| 文章编号： | 1001-9081(2004)12-0108-02 |
New algorithm for finding the critical paths |
| |
| XU Feng-sheng,HUANG Qian.New algorithm for finding the critical paths[J].journal of Computer Applications,2004,24(12):108-109. |
| |
| Authors: | XU Feng-sheng HUANG Qian |
| |
| Affiliation: | XU Feng-sheng~1,HUANG Qian~2 |
| |
| Abstract: | Critical paths are usually obtained by topological collating. A new algorithm for finding critical paths on the breadth-first search was put forward. The data structure of the algorithm is Orthogonal List, and it didn't need topological sorting. Time complexity of the Algorithm is O(n+e), with higher efficiency than traditional ones. |
| |
| Keywords: | critical path algorithm orthogonal list breadth_first search |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
