Dijkstra's Algorithm

Time and Space Complexity

• Best Case Time Complexity: O(E + V log V)
• Average Case Time Complexity: O(E log V)
• Worst Case Time Complexity: O(V²)
• Space Complexity: O(V)