(1) Please write down h(1), h(2), h(3), h(4) for the purpose of re-weighting. Please explain briefly...

  

Transcribed Image Text:

(1) Please write down h(1), h(2), h(3), h(4) for the purpose of re-weighting. Please explain briefly how you get these numbers. (2) Please write down the new weight matrix W after re-weighting W from question 1(1). (3) Please write down the final distance matrix 5 and final predecessor matrix fl after repeating DIJKSTRA (G, W, s) for every s from V. (4) Draw the resulted shortest path trees (only tree edges and vertices) from above problem 3(3). (5) Please write down the final distance matrix D and final predecessor matrix II for the original graph G and W. 7 2 1 2 4 5 3 10 -8 4 (1) Please write down h(1), h(2), h(3), h(4) for the purpose of re-weighting. Please explain briefly how you get these numbers. (2) Please write down the new weight matrix W after re-weighting W from question 1(1). (3) Please write down the final distance matrix 5 and final predecessor matrix fl after repeating DIJKSTRA (G, W, s) for every s from V. (4) Draw the resulted shortest path trees (only tree edges and vertices) from above problem 3(3). (5) Please write down the final distance matrix D and final predecessor matrix II for the original graph G and W. 7 2 1 2 4 5 3 10 -8 4

Answer rating: 100% (QA)

1 To reweight a graph using Dijkstras algorithm you typically assign new weights to the edges You ca... View the full answer