Loading Thita. Almost there...
Pattern 10 of 15
Master graph algorithms including DFS/BFS traversal, topological sort, shortest paths (Dijkstra, Bellman-Ford), Union-Find, and advanced graph concepts.
12
180 min
Use DFS to find connected components and count islands in grids. Flood fill and province counting problems.
Use BFS for shortest path in unweighted graphs. Solve word ladder, rotting oranges, and matrix problems.
Master topological sorting using Kahn's BFS algorithm. Solve course schedule and build order problems.
Detect cycles in directed graphs using DFS with coloring (white, gray, black) approach.
Find shortest paths with constraints using Bellman-Ford algorithm and BFS with limited stops.
Master Dijkstra's algorithm for finding shortest paths in weighted graphs with non-negative edges.
Learn to deep copy and clone graph structures using DFS/BFS with visited mapping.
Optimize BFS by searching from both source and target simultaneously. Reduce time complexity significantly.
Find bridges and articulation points in graphs using Tarjan's low-link algorithm.
Master Union-Find data structure with path compression and union by rank for connectivity problems.
Find minimum spanning tree using Kruskal's or Prim's algorithm with Union-Find or heap.
Find strongly connected components in directed graphs using Kosaraju's or Tarjan's algorithm.
Access theory, code examples, and practice problems.
Open DSA Learning Path