Breadth-First Search (BFS)

Time and Space Complexity

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