< 1 >
Dijkstra's algorithm
Dijkstra's algorithm is an algorithm for finding the shortest path between two different nodes in a weighted graph.
Explanation
The shortest path between the vertices A and F in a road map.
Shortest path (A, C, E, D, F), blue, between vertices A and F in the weighted directed graph
