New algorithm for finding the critical paths
XU Feng-sheng · Jisuanji gongcheng · 2004
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.