What is length of shortest path from to 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
The answer is 3.
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
0 solutions
No explanations have been posted yet. Check back later!