This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
2009 WRI World Congress on Computer Science and Information Engineering
A Novel Algorithm for Critical Paths
Los Angeles, California USA
March 31-April 02
ISBN: 978-0-7695-3507-4
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," csie, vol. 1, pp.226-229, 2009 WRI World Congress on Computer Science and Information Engineering, 2009
Usage of this product signifies your acceptance of the Terms of Use.