Loading repovive.com/roadmaps/graph-theory
Roadmaps
Graph Theory
Subtree DP
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
1
Intro
2
Trees as Recursive Structures
3
What is Subtree DP
4
DFS for Tree DP
5
Example: Count Subtree Sizes
6
Quiz: Basic Tree DP
7
State Definition on Trees
8
Aggregating Child Values
9
Time Complexity of Tree DP
10
Rooted vs Unrooted Trees
11
CSES 1674 Subordinates - Problem Statement
12
CSES 1674 Subordinates - Core Idea
13
CSES 1674 Subordinates - Recurrence
14
CSES 1674 Subordinates - Algorithm
15
CSES 1674 Subordinates - Implementation
16
CSES 1674 Subordinates - Walkthrough
17
CSES 1674 Subordinates - Lessons
18
Quiz: Subordinates Problem
19
Include/Exclude Pattern
20
Include/Exclude Transitions
21
LeetCode 337 House Robber III - Problem Statement
22
LeetCode 337 House Robber III - State Definition
23
LeetCode 337 House Robber III - Recurrence
24
LeetCode 337 House Robber III - Base Case
25
LeetCode 337 House Robber III - Implementation
26
LeetCode 337 House Robber III - Walkthrough
27
LeetCode 337 House Robber III - Lessons
28
Quiz: Include/Exclude Pattern
29
Path Problems on Trees
30
Combining Paths from Children
31
LeetCode 124 Binary Tree Maximum Path Sum - Problem Statement
32
LeetCode 124 Binary Tree Maximum Path Sum - State Definition
33
LeetCode 124 Binary Tree Maximum Path Sum - Core Idea
34
LeetCode 124 Binary Tree Maximum Path Sum - Handling Negatives
35
LeetCode 124 Binary Tree Maximum Path Sum - Algorithm
36
LeetCode 124 Binary Tree Maximum Path Sum - Implementation
37
LeetCode 124 Binary Tree Maximum Path Sum - Walkthrough
38
LeetCode 124 Binary Tree Maximum Path Sum - Lessons
39
Quiz: Path Problems
40
Rerooting Technique Preview
41
Common Mistakes in Tree DP
42
Tree DP vs Graph DP
43
When to Use Subtree DP
44
Section Recap
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
8.1
Intro
2 minutes
100%
Tasks
Read Unit