离散数学03252.pptVIP

離散數學DISCRETE and COMBINATORIAL MATHEMATICS 13 Optimization and Matching 指導老師：鄧有光 重要章節 13-1 Dijkstra’s Shortest-Path Algorithm 13-2 Minimal Spanning Trees : The Algorithms of Kruskal and Prim 13-3 Transport Networks : The Max- Flow Min-Cut Theorem 13-1 Dijkstra’s Shortest-Path Algorithm 13-1 Dijkstra’s Shortest-Path Algorithm Dijkstra’s Shortest-Path Algorithm Step 1: Set the counter i=0 and S0 = {v0}. Label v0 with (0 , -) and each v ≠ v0 with (∞ , -). If n=1, then V = {v0} and the problem is solved. If n1, continue to step (2). Step 2: For each v in Si replace, when possible,