Dijkstra’s Algorithm

Dijkstra’s is used to find shortest path from a single source to all the nodes in the graph. This algorithm cannot be used on graphs with negative edge weights or cycles.

Complexity: O(V*V) or O ( E Log V) for the optimized implementation

Output

0 0
2 2
1 10
3 10
5 12
4 12
5 12