What is length of shortest path from \(A\) to \(D\) after reweighting

Look at the following graph. What is the path length of the shortest path from A to D after reweighting it with the technique used by Johnson's Algorithm?

Graph with 4 vertices

Graph with 4 vertices

×

Problem Loading...

Note Loading...

Set Loading...