Computer scienceAlgorithms and Data StructuresAlgorithmsGraph algorithmsShortest path algorithms

Johnson's algorithm

Theory

Intermediate step

Report a typo

We are using Johnson's algorithm in order to find all-pairs shortest paths in the following graph:

The original weighted graph

Which of the pictures below represents the reweighted graph on which Dijkstra's algorithm will be applied in step 4?

Select one option from the list
___

Create a free account to access the full topic