基于广度优先遍历的关键路线生成树算法A Critical Path Spanning Tree Algorithm Based on Breadth-First Traversal

Abstract: To get critical path is of great significance for the use of critical path method in project management. This paper first defines project management graph model, and then puts forward a critical path spanning tree algorithm based on breadth-first traversal, and then achieves the optimization algorithm through the research of the model. The simula- tion shows that the algorithm can create a tree which keeps the maximum path from the root node to any node in the graph model, and get the critical path easily through the tree.

Top