赋权图的最短路与关键路的算法与实现论文.doc

西安石油大学本科毕业设计（论文） 赋权图的最短路与关键路的算法与实现 摘 要：图形是由点和线构成的集合．赋权图的最短路就是任意两个节点之间的权值之和最小的路径．最短路不仅仅指一般地理意义上的距离最短,还可以引申到其它的度量, 如时间、费用、线路容量等．本文介绍了如何求最短路的有效算法: Dijkstra算法．它能求出赋权图的任何两个节点之间权值之和的最小路径. 关键路径通常总是决定项目工期的进度活动序列．它是项目中从发点到收点的最长路径.关键路径法（Critical Path Method,CPM）是一种通过分析哪个活动序列（哪条路线）进度安排的总时差最少来预测项目工期的一门网络分析技术．关键路径法,能推算出项目的最短完成时间和项目各项活动的可能开始和结束时间. 关键词: 图的邻接矩阵; 最短路径; Dijkstra算法; 关键路径 The algorithm and implementation of the Shortest Path and the Critical Path HYPERLINK app:lj:摘要?ljtype=blngljblngcont=0ljtran=abstractＡbstract: Graphics are constituted by the sets of points and lines. The shortest path of the weighted graph is the minimum sum of the weight between any two vertices. The shortest path not only refers to the shortest distance, but also can be extended to other metrics, such as time, cost, line capacity and so on. Dijkstra’s algorithm was the most efficient algorithm for how to find the Shortest Path of weighted graph, which is studied in this paper. Dijkstra’s algorithm was used to calculate the minimum value of weighted graph between any two vertices. The critical path is usually used to obtain the progress of the project in activities. It is the longest path of a project from the starting point to the ending point. The critical path method (Critical Path Method, CPM) which analysis a sequence of the least time in activities or predict (which route) the schedule better. The critical path method can be used to calculate the shortest completion time, starting and ending times in project activities. Keywords: Adjacency matrix of the graph; The Shortest Path; Dijkstra’s algorithm; The Critical Path 目 录 TOC \o 1-3 \h \u HYPERLINK \l _Toc6057 第一章 绪论 PAGEREF _Toc6057 1 HYPERLINK \l _Toc32480 1.1 课题的背景 PAGEREF _Toc32480 1 HYPERLINK \l _Toc11812 1.2 课题的目的 PAGEREF _Toc11812 1 HYPERLINK \l _Toc9870 1.3 课题的国内外研究状况 PAGEREF _Toc9870 1 HYPERLINK \l _Toc19420 1.4 课题的意义和研究方法 PAGEREF _Toc19420 1 HYPERLINK \l _Toc