4. a) [15pts] Given the following weighted digraph D, show the matrices S,[0:5,0:5], P[0:5,0:5], k=0,...,6 as...

 

Transcribed Image Text:

4. a) [15pts] Given the following weighted digraph D, show the matrices S,[0:5,0:5], P[0:5,0:5], k=0,...,6 as computed by Floyd's algorithm: D= 3 3411Y2 b) [5pts] Describe how the final Pmatrix P6 can be used to find a shortest path from vertex 1 to vertex 3. 4. a) [15pts] Given the following weighted digraph D, show the matrices S,[0:5,0:5], P[0:5,0:5], k=0,...,6 as computed by Floyd's algorithm: D= 3 3411Y2 b) [5pts] Describe how the final Pmatrix P6 can be used to find a shortest path from vertex 1 to vertex 3.