Use the V 8 and P 8 matrices computed in Section 2.7 to show that the shortest path tree rooted at node D (for the problem at hand) is given by the highlighted links in Figure 2.52. In the matrix...

Use the V⁸
and P⁸
matrices computed in Section 2.7 to show that the shortest path tree rooted at node D (for the problem at hand) is given by the highlighted links in Figure 2.52.

In the matrix approach to finding the shortest paths in a network, what is the interpretation of the V^k
matrix (i.e., the matrix of distances you obtain after the kth iteration of the algorithm)?