基于广度优先遍历关键路线生成树算法.pdf

Computer Science and Application 计算机科学与应用, 2012, 2, 51-56 doi:10.4236/csa.2012.22010 Published Online June 2012 (/journal/csa) A Critical Path Spanning Tree Algorithm Based on * Breadth-First Traversal 1 2 Dongmei Fu , Dingfu Lian School of Automation, University of Science and Technology, Beijing Email: liandingfu@126.com Received: Apr. 21st, 2012; revised: May 14th, 2012; accepted: May 25th, 2012 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. Keywords: Project Management Graph Model; Spanning Tree; Critical Path; Breadth-First Traversal 基于广度优先遍历的关键路线生成树算法* 1 榑2 付冬梅 ，练丁 北京科技大学自动化学院，北京 Email: liandingfu@126.com 收稿日期：2012 年 4 月 21 日；修回日期：2012 年 5 月 14 日；录用日期：2012 年 5 月 25 日 摘 要：关键路线的确定对于运用关键路线法进行项目管理具有十分重要的意义。本文首先定义了项目管理图 模型，然后在此基础上提出了一种基于广度优先遍历的关键路线生成树算法，最后通过对项目管理图模型的研 究，实现了对算法的优化。仿真结果表明，该算法能够生成一棵保留根节点到任意节点最大路径信息的树，通 过生成的树能够方便地确定关键路线。 关键词：项目管理图模型；生成树；关键路线；广度优先遍历 1. 引言 找出控制项目工期的关键路线，在一定工期、成本、 资源条