Computer scienceAlgorithms and Data StructuresAlgorithmsGraph algorithmsShortest path algorithms

Dijkstra's algorithm

The shortest paths between nodes

Report a typo

Given below is a directed weighted graph:

The shortest paths between nodes

Using Dijkstra's algorithm, find the shortest path from the node 1 to all other nodes of the graph. Choose one of the options below that corresponds to the distances of these paths.

Select one option from the list

1 to 2 is 7, 1 to 3 is 9, 1 to 4 is 20, 1 to 5 is 26, 1 to 6 is 11.

1 to 2 is 7, 1 to 3 is 9, 1 to 4 is 26, 1 to 5 is 23, 1 to 6 is 14.

1 to 2 is 7, 1 to 3 is 9, 1 to 4 is 20, 1 to 5 is 26, 1 to 6 is 35.

1 to 2 is 7, 1 to 3 is 9, 1 to 4 is 26, 1 to 5 is 20, 1 to 6 is 11.

___

Create a free account to access the full topic