摘要
介绍AOE网中关键路径的相关概念,通过算法描述和实例,探讨基于拓扑排序求解、P矩阵的求解和广度优先搜索遍历(BFS)方法三种算法,求解AOE网中关键路径的实现过程,并进一步从算法的时间复杂度、数据结构形式及实现的容易程度等几方面分析三种求关键路径算法的优劣。
This paper presents the related concepts of critical path in AOE network. With support of algorithm description and specific examples, it also gives detail information about how to find the critical path in AOE network by means of three different kinds of algorithm, including topological sorting, solution of P matrix and breadth-first traversal search（BFS） method. Furthermore,this paper analyses the pros and cons of three algorithms for seeking the critical path in terms of algorithm＇s time complexity, data structure and implementation complexity.
出处
《重庆电力高等专科学校学报》
2010年第1期37-39,42,共4页
Journal of Chongqing Electric Power College
