Computer Science and Information Engineering, World Congress on (2009)

Los Angeles, California USA

Mar. 31, 2009 to Apr. 2, 2009

ISBN: 978-0-7695-3507-4

pp: 226-229

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/CSIE.2009.310

ABSTRACT

The problem of finding all the critical paths is a mathematics based algorithm for scheduling a set of project activities. A new algorithm to find all the critical paths for an AOE Network is presented in this paper. With this algorithm, topological inverted sequence scanning is not required again. A predecessors list is designed for each event node to record the earliest startingÂ Â time and it’s predecessors in the longest path. The data structure used in this algorithm is more simple and it can be realized more easily. The running time of this algorithm is O(n+e)

INDEX TERMS

critical path, AOE Networks, topological sort, predecessors list, adjacency list

CITATION

TianZhi Li,
"A Novel Algorithm for Critical Paths",

*Computer Science and Information Engineering, World Congress on*, vol. 01, no. , pp. 226-229, 2009, doi:10.1109/CSIE.2009.310