Loading repovive.com/roadmaps/graph-theory
Roadmaps
Graph Theory
Depth First Search (DFS)
Problemset
Discussion
AI Helper
Graph Fundamentals
0/41
Depth First Search (DFS)
0/41
1
Intro
2
The Visited Array
3
The DFS Logic Flow
4
The Code Template
5
How to Call It
6
Visualizing the Trace
7
Quiz: DFS Traversal Order
8
Time Complexity of DFS
9
Space Complexity of DFS
10
Quiz: DFS Complexity
11
LeetCode 133 Clone Graph - Problem Statement
12
LeetCode 133 Clone Graph - Strategy
13
LeetCode 133 Clone Graph - Why Depth First
14
LeetCode 133 Clone Graph - Handling Cycles
15
LeetCode 133 Clone Graph - Core Idea
16
LeetCode 133 Clone Graph - Algorithm
17
LeetCode 133 Clone Graph - Recursion
18
LeetCode 133 Clone Graph - Implementation
19
LeetCode 133 Clone Graph - Lessons
20
Quiz: Cycle Handling in DFS
21
LeetCode 841 Keys and Rooms - Problem Statement
22
LeetCode 841 Keys and Rooms - Mapping
23
LeetCode 841 Keys and Rooms - Solution
24
LeetCode 841 Keys and Rooms - Implementation
25
Connected Components
26
Counting Components - The Idea
27
Counting Components - Algorithm
28
Quiz: Connected Components
29
LeetCode 547 Number of Provinces - Problem Statement
30
LeetCode 547 Number of Provinces - Input
31
LeetCode 547 Number of Provinces - Implementation
32
DFS on Trees
33
Avoiding Cycles in Trees
34
Carrying State in DFS
35
Quiz: DFS on Trees
36
Codeforces 580C Kefa and Park - Problem Statement
37
Codeforces 580C Kefa and Park - State
38
Codeforces 580C Kefa and Park - Logic
39
Codeforces 580C Kefa and Park - Implementation
40
Quiz: DFS State Tracking
41
Section Recap
Breadth First Search (BFS)
0/40
Flood Fill & Grid Graphs
0/32
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
2.1
Intro
2 minutes
100%
Tasks
Read Unit