Computer scienceAlgorithms and Data StructuresAlgorithmsGraph algorithmsShortest path algorithms

Dijkstra's algorithm

Theory

The shortest path between two nodes

Report a typo

Apply Dijkstra's algorithm to find the shortest path between the nodes a and h in the following undirected graph:

Find the shortest path between two nodes

Print the length of this path in the field below.

Select one option from the list
___

Create a free account to access the full topic