Loading repovive.com/roadmaps/graph-theory
Roadmaps
Graph Theory
Flood Fill & Grid Graphs
Problemset
Discussion
AI Helper
Graph Fundamentals
0/41
Depth First Search (DFS)
0/41
Breadth First Search (BFS)
0/40
Flood Fill & Grid Graphs
0/32
1
Intro
2
The Paint Bucket
3
Counting Islands
4
Dependencies and Cycles
5
Cycle Detection - The Logic
6
The Three Colors
7
Cycle Detection - Visualizing
8
Quiz: Grid Graph Traversal
9
Not Every Grid Needs Traversal
10
Quiz: Cycle Detection in Directed Graphs
11
LeetCode 733 Flood Fill - Problem Statement
12
LeetCode 733 Flood Fill - Strategy
13
LeetCode 733 Flood Fill - Why It Works
14
LeetCode 733 Flood Fill - Implementation
15
LeetCode 200 Number of Islands - Problem Statement
16
LeetCode 200 Number of Islands - Core Idea
17
LeetCode 200 Number of Islands - Visualization
18
LeetCode 200 Number of Islands - Implementation
19
Quiz: Island Counting Logic
20
LeetCode 463 Island Perimeter - Problem Statement
21
LeetCode 463 Island Perimeter - Core Idea
22
LeetCode 463 Island Perimeter - Algorithm
23
LeetCode 463 Island Perimeter - Implementation
24
LeetCode 463 Island Perimeter - Lessons
25
Quiz: Perimeter vs Area
26
LeetCode 695 Max Area of Island - Problem Statement
27
LeetCode 695 Max Area of Island - Core Idea
28
LeetCode 695 Max Area of Island - Algorithm
29
LeetCode 695 Max Area of Island - Implementation
30
LeetCode 695 Max Area of Island - Lessons
31
Quiz: Flood Fill Boundaries
32
Section Recap
Bipartite Graphs
0/48
Tree Fundamentals
0/44
Tree Diameter & Center
0/45
Subtree DP
0/44
Floyd-Warshall Algorithm
0/41
Dijkstra's Algorithm
0/40
Bellman-Ford Algorithm
0/48
Mixed Practice - Shortest Paths
0/36
Disjoint Set Union (DSU)
0/49
Minimum Spanning Trees
0/48
Topological Sort
0/41
DP on DAGs
0/50
Mixed Practice: Graph Traversals
0/35
Strongly Connected Components
0/45
2-SAT
0/51
Mixed Practice: Connectivity & MST
0/35
Rerooting Technique
0/39
Euler Tour Technique
0/51
Mixed Practice: Tree Fundamentals
0/29
Binary Lifting
0/50
Lowest Common Ancestor (LCA)
0/51
Games on Graphs
0/62
Heavy-Light Decomposition
0/49
Centroid Decomposition
0/55
Small-to-Large Merging
0/40
Functional Graphs
0/47
Mixed Practice: Advanced Tree Techniques
0/36
Bridges and Articulation Points
0/58
Network Flow
0/54
Maximum Bipartite Matching
0/50
Minimum Cut
0/47
Euler Paths and Circuits
0/37
Mixed Practice: Advanced Graphs
0/24
4.1
Intro
2 minutes
100%
Tasks
Read Unit