What will be the shortest path from AA to DD after reweighting?

Look at the following graph. Which path will be the shortest path from AA to DD 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...