Loading repovive.com/roadmaps/graph-theory
Roadmaps
Graph Theory
Mixed Practice: Tree Fundamentals
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
Rerooting Technique
0/39
Euler Tour Technique
0/51
Mixed Practice: Tree Fundamentals
0/29
1
Intro
2
Decision Question 1
3
Decision Question 2
4
Quiz: Technique Selection
5
Problem - Subordinates
6
Think First
7
Quiz: Subordinates Technique
8
Subordinates - Implementation
9
Problem - Tree Diameter
10
Think First
11
Quiz: Diameter Approaches
12
Tree Diameter - Implementation
13
Problem - Tree Matching
14
Think First
15
Quiz: Matching States
16
Tree Matching - Implementation
17
Problem - Tree Distances II
18
Think First
19
Quiz: Rerooting Transition
20
Tree Distances II - Implementation
21
Problem - Choosing Capital
22
Think First
23
Quiz: Directed Transition
24
Choosing Capital - Implementation
25
Problem - Max White Subtree
26
Think First
27
Quiz: Max White Subtree
28
Max White Subtree - Implementation
29
Section Recap
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
23.1
Intro
3 minutes
100%
Tasks
Read Unit