Graph BFS

Category: Graphs

Difficulty: intermediate

Description: Breadth-first traversal of graphs

Time Complexity: O(V+E)

Space Complexity: O(V)

Related LeetCode Problems

• 102. Binary Tree Level Order Traversal (Easy)
• 1971. Find if Path Exists in Graph (Easy)
• 133. Clone Graph (Medium)
• 269. Alien Dictionary (Hard)
• 329. Longest Increasing Path in a Matrix (Hard)
• 279. Perfect Squares (Medium)
• 1197. Minimum Knight Moves (Medium)
• 752. Open the Lock (Medium)
• 200. Number of Islands (Medium)
• 317. Shortest Distance from All Buildings (Hard)
• 909. Snakes and Ladders (Medium)
• 542. 01 Matrix (Medium)
• 785. Is Graph Bipartite? (Medium)
• 119. Pascal's Triangle II (Easy)