数据结构拓扑排序和关键路径的求解.doc

数据结构课程设计大作业 题 目拓扑排序和关键路径的求解 专 业 计算机科学与技术 学生姓名 学 号 指导教师 完成日期 2015.3 哈尔滨理工大学 目 录 一：实验内容概述 2 二：实验目的概述 2 三：解题思路的描述 3 四：源程序清单 6 五：程序调试及测试结果 11 六：结论 13 七：参考文献 13 拓扑排序和关键路径的求解 【内容摘要】建立一个AOV网，把对象与对象之间的关系在AOV网中体现出来，要注意AOV网不可以建立成环的形式，否则工程将无法进行。之后对建立的网进行拓扑排序。对于一个工程来说，不仅要关心各子工程的之间的先后关系，还要关系整个工程的最短时间，即有向带权图的关键路径问题。在描述关键路径问题的有向图时，顶点表示事件，便表示活动，边上的权表示活动所需的时间，即此有向图为AOE网。对AOV网构造其所有定点的线性序列，此序列保持网中各顶点间原有的先后关系，且是原来没有先后关系的顶点也成为有先后关系，这样的线性序列称为拓扑有序序列，构造AOV网的拓扑有序序列操作称为拓扑排序。在AOE网中有些活动可以并行地进行，所以完成整个工程的最短时间是从源点到汇点的最长路径的长度，路径长度是路径各边的权值之和，把从源点到汇点的最长路径称为关键路径。 【关键字】AOE网 拓扑排序 关键路径 The topological sort and critical path method 【Abstract】Establish a AOV nets, the relationship between the object and the object in AOV nets reflected in AOV nets, should pay attention to the form of cant establish cyclization, otherwise the project will not be able to do so. After the nets to establish topological sort.For a project, it should not only about the relationship between the construction of the project, the shortest time relationship, which is the key to the weighted graph routing problem. In the description of the critical path problem digraph, vertices, then said that events, the right side of the time needed to denote activities, namely, this is to the net. AOE For all its designated AOV network structure, the sequence of linear sequence of each vertex keep the relationship between the original and is originally has no successively relationship has become a vertex, such as linear topological orderly sequences, AOV tectonic sequences of topological orderly sequences operation called topological sort. In some activity can AOE net parallel to complete the whole project, so the shortest time from point of origin to the length of the longest path sinks, path length is the path to the sum of the weights, from the point of origin to the longest path called zhonghua critical p