Unformatted text preview: 7. [BB] A shortest path has length 11. One way in which permanent labels might be assigned is in the order A, B, D, C, S, J, I, H, E, L, G, F, K, M, 0, P, N, Q, R. 8. The shortest path is ACIOQT, oflength 12. 9. A(,O) (A, 2) B G(A,I) F(A,I) (I,ll) K 3 4 J(G,5) M(L,8) A shortest path A to M has length 16. One such route is ABCFIKLM....
View
Full Document
 Summer '10
 any
 Graph Theory, The Order, Shortest path problem, shortest path, permanent labels

Click to edit the document details