運籌學(xué)05_圖與網(wǎng)絡(luò)分析2-最短路888

1、0P(P )min(P)路P0的權(quán)稱為從vs到vt的距離，記為d(vs,vt)。11112minkllkiijijLLL vV ,vV為從v1到vk的最短路的長度，l表示在從v1到vk的最短路上，與vk相鄰的點是vl4、若最后一個頂點vn未標(biāo)號，則轉(zhuǎn)回第2步；若vn已標(biāo)號，則從vn開始，按照第一個標(biāo)號逆向追蹤，直到v1，就得到從v1到vn的最短路，vn的第二個標(biāo)號表示最短路的長度。512756342552731357112325205127563425527313571051275634255273135710512756342552731357105127563425527313571051

2、275634255273135710351275634255273135710(1,3)512756342552731357104(1,3)51275634255273135710(2,4)(1,3)(4,4)512756342552731357107(1,3)(2,4)51275634255273135710(3,7)(1,3)(2,4)512756342552731357108(1,3)(2,4)(3,7)51275634255273135710(6,8)(1,3)(2,4)(3,7)51275634255273135710(1,3)(2,4)(3,7)(6,8)(5,13)5127563

3、4255273135710(1,3)(2,4)(3,7)(6,8)(5,13)(0)(1,1)(1,3)(3,5)(2,6)(5,10)(5,9)(5,12)v1v3v222-3(m 1)(m)1k1iikikLmin L(v ,v )ik存在弧，包括3、如果對所有的點L1k(m)= L1k(m+1）都成立則逆向追蹤，找出最短路，算法終止；若存在L1k(m) L1k(m+1）,則令m=m+1，返回第2步v1v2v3v432-2-145(0)v1v2v3v432-2-145(1,2)(1,3)(2,1)(0)v1v2v3v432-2-145(3,1)(1,3)(2,0)(0)v1v2v3v432

4、-2-145(3,1)(1,3)(2,1)v8v2v4v7v5v1v3v611111123355223678終點起點v1v2v3v4v5v6v7v8t=1t=2t=3t=4v10-1-230000v2602-1-5-5-5v3-30-51-2-2-2-2v48023-7-7-7v5-101-3-3v61017-1-1-1v7-105-5-5v8-3-5066lijP(t)1jv1v2v3v4v52314153將邊vi，vj看作兩條弧，(vi, vj)和(vj, vi)購購置置年年份份12345單位（萬元）1111121213使用年數(shù) 0-1 1-2 2-3 3-4 4-5維維修修費費用用（萬萬元元）5681