Opening your learning path
Progress is saved as you study.
Opening your learning path
Progress is saved as you study.
The Graph BFS - Connected Components / Island Counting pattern applies when you need the Graph BFS - Connected Components / Island Counting technique within the Graph Traversal Patterns (DFS & BFS) pattern. Its time complexity is O(V + E) and space complexity O(V). It is used in 4 problems on Thita, including 01 Matrix, Rotting Oranges and Shortest Path in Binary Matrix. Common variations are Graph DFS - Cycle Detection (Directed Graph) and Deep Copy / Cloning.
Use BFS for shortest path in unweighted graphs. Solve word ladder, rotting oranges, and matrix problems.
Graph BFS - Connected Components / Island Counting is one of the 12 subpatterns of the Graph Traversal Patterns (DFS & BFS) pattern, which covers dFS/BFS traversal, topological sort, shortest paths, Union-Find, and MST. The whole pattern is about 5 hours of study. This subpattern is a core technique: expect it to come up directly in interviews.
Master graph algorithms including DFS/BFS traversal, topological sort, shortest paths (Dijkstra, Bellman-Ford), Union-Find, and advanced graph concepts. Problems in this subpattern are usually searched for as word ladder, rotting oranges, shortest path grid, BFS graph, leetcode 127, leetcode 994.
Read the theory for Graph BFS - Connected Components / Island Counting, then work the problems attached to it in the browser editor. Your solution runs against the problem's test cases, and the AI coach offers a hint about the technique you are missing rather than a finished solution. Progress is tracked per subpattern, so the Graph Traversal Patterns (DFS & BFS) tracker shows this one as covered once you have solved its problems.
Graph BFS - Connected Components / Island Counting is one lesson in a 16-pattern DSA course. If you are preparing end to end, work the interview-critical patterns first and use the pattern sheet as the checklist; if you are here for one technique, the Graph Traversal Patterns (DFS & BFS) guide is the shortest path back to the rest of it.