賦權(quán)圖的最短路與關(guān)鍵路的算法與實(shí)現(xiàn)

1、西安石油大學(xué)本科畢業(yè)設(shè)計(jì)（論文）賦權(quán)圖的最短路與關(guān)鍵路的算法與實(shí)現(xiàn)摘要：要：圖形是由點(diǎn)和線構(gòu)成的集合賦權(quán)圖的最短路就是任意兩個(gè)節(jié)點(diǎn)之間的權(quán)值之和最小的路徑最短路不僅僅指一般地理意義上的距離最短還可以引申到其它的度量如時(shí)間、費(fèi)用、線路容量等本文介紹了如何求最短路的有效算法:Dijkstra算法它能求出賦權(quán)圖的任何兩個(gè)節(jié)點(diǎn)之間權(quán)值之和的最小路徑.關(guān)鍵路徑通常總是決定項(xiàng)目工期的進(jìn)度活動(dòng)序列它是項(xiàng)目中從發(fā)點(diǎn)到收點(diǎn)的最長(zhǎng)路徑.關(guān)鍵路徑法（Crit

2、icalPathMethodCPM）是一種通過(guò)分析哪個(gè)活動(dòng)序列（哪條路線）進(jìn)度安排的總時(shí)差最少來(lái)預(yù)測(cè)項(xiàng)目工期的一門(mén)網(wǎng)絡(luò)分析技術(shù)關(guān)鍵路徑法能推算出項(xiàng)目的最短完成時(shí)間和項(xiàng)目各項(xiàng)活動(dòng)的可能開(kāi)始和結(jié)束時(shí)間.關(guān)鍵詞關(guān)鍵詞:圖的鄰接矩陣最短路徑Dijkstra算法關(guān)鍵路徑西安石油大學(xué)本科畢業(yè)設(shè)計(jì)（論文）目錄第一章緒論...................................................................

3、.........................................11.1課題的背景.....................................................................................................11.2課題的目的............................................................

4、.........................................11.3課題的國(guó)內(nèi)外研究狀況.................................................................................11.4課題的意義和研究方法......................................................................

5、...........11.5課題的構(gòu)成及主要研究?jī)?nèi)容.........................................................................2第二章基礎(chǔ)知識(shí)....................................................................................................22.1集合的概述...

6、................................................................................................22.2圖論基礎(chǔ).......................................................................................................3第三章賦權(quán)圖最短路的算法

7、與應(yīng)用....................................................................93.1最短路的概念.................................................................................................93.2最短路算法.................................

8、....................................................................93.3Dijkstra算法..................................................................................................103.4賦權(quán)圖最短路算法在艦船通道路線設(shè)計(jì)中的應(yīng)用..............

9、.....................13第四章關(guān)鍵路徑法與應(yīng)用..................................................................................154.1關(guān)鍵路徑法的基本原理...............................................................................154.2網(wǎng)絡(luò)計(jì)劃的

10、特點(diǎn)...........................................................................................164.3網(wǎng)絡(luò)計(jì)劃的分類...........................................................................................174.4網(wǎng)絡(luò)計(jì)劃關(guān)鍵路徑的應(yīng)用........

11、...................................................................174.4.1搭接網(wǎng)絡(luò)計(jì)劃示例............................................................................174.4.2搭接網(wǎng)絡(luò)中的連接關(guān)系.............................................

12、.......................184.4.3搭接網(wǎng)絡(luò)計(jì)劃的時(shí)間參數(shù)計(jì)算示例................................................18第五章網(wǎng)絡(luò)計(jì)劃優(yōu)化..........................................................................................245.1工期優(yōu)化.................