Dijkstra's Steps

Follow this link to read about the algorithm.

Facts about Dijkstra's

• V is the number of vertices and E is the number of edges in the graph.
• Worst case time complexity is O(E logV)
• Space complexity is O(V+E)