Unformatted text preview: 2 D(C,5) H(A,I) 9 G(I,9) 1 F(G,10) 1C (B,4) (b) The final labeling, starting at H is shown to the right. The shortest path from H to D is HABCD and has length 6. A(H, 1) Cf~~=~~i!It;=:~ E(K,13) H( ,0) 9 G(H,9) 1 F(G,10) 281...
View
Full Document
 Summer '10
 any
 Graph Theory, Shortest path problem, The Final, shortest path, final labeling, G,6)

Click to edit the document details