Loading repovive.com/roadmaps/graph-theory
Roadmaps
Graph Theory
Mixed Practice: Connectivity & MST
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
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
1
Intro
2
Core Decisions
3
SCC vs Bridges
4
MST vs DSU
5
Quiz: Pattern Signals
6
Quiz: Bidirectional Reachability
7
Problem - Road Construction
8
Recognizing DSU
9
Implementation - Road Construction
10
Quiz: Component Count
11
Problem - Road Reparation
12
Recognizing MST
13
Implementation - Road Reparation
14
Quiz: MST Edge Count
15
Problem - Flight Routes Check
16
Recognizing SCC
17
Implementation - Flight Routes Check
18
Quiz: SCC Count
19
Problem - Critical Connections
20
Recognizing Bridges
21
Implementation - Critical Connections
22
Quiz: Bridge Condition
23
Problem - Checkposts
24
Why SCC?
25
Implementation - Checkposts
26
Quiz: SCC Optimization
27
Problem - Edges in MST
28
Edge Classification
29
Implementation - Edges in MST
30
Quiz: MST Edge in ALL
31
Practice Strategy
32
Common Combinations
33
Quiz: Technique Pairing
34
Next Steps
35
Section Recap
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
20.1
Intro
3 minutes
100%
Tasks
Read Unit