2) While finding a Dynamic Programming solution to the all-pairs shortest path, we discussed the Floyd...

 

Transcribed Image Text:

2) While finding a Dynamic Programming solution to the all-pairs shortest path, we discussed the Floyd Algorithm and we gave the following definition: Dk [ij] length of a shortest path from v to vj using only vertices in the set {V1, V2 VK} Dk is the matrix that all cells has been computed for all i,j combination based on the following formula: o Dk [ij]=min { DK-1 [i,j], DK-1 [i,k] + DK-1 [k,j] } 2 3 a) Show Do matrix (5 points) b) Calculate D1 matrices, explain your work (10 points) c) Calculate D2 matrices, explain your work (10 points) 2) While finding a Dynamic Programming solution to the all-pairs shortest path, we discussed the Floyd Algorithm and we gave the following definition: Dk [ij] length of a shortest path from v to vj using only vertices in the set {V1, V2 VK} Dk is the matrix that all cells has been computed for all i,j combination based on the following formula: o Dk [ij]=min { DK-1 [i,j], DK-1 [i,k] + DK-1 [k,j] } 2 3 a) Show Do matrix (5 points) b) Calculate D1 matrices, explain your work (10 points) c) Calculate D2 matrices, explain your work (10 points)