Loading repovive.com/roadmaps/graph-theory
Roadmaps
Graph Theory
Tree Diameter & Center
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
1
Intro
2
What is Tree Diameter
3
Why Diameter Matters
4
The Naive Approach
5
The Two-BFS Trick
6
Why Two-BFS Works
7
Two-BFS Implementation
8
Quiz: Two-BFS Method
9
CSES 1131 Tree Diameter - Problem Statement
10
CSES 1131 Tree Diameter - Core Idea
11
CSES 1131 Tree Diameter - Algorithm
12
CSES 1131 Tree Diameter - Implementation
13
CSES 1131 Tree Diameter - Walkthrough
14
CSES 1131 Tree Diameter - Lessons
15
The DP Approach
16
DP Method - How It Works
17
DP Method - Implementation
18
Two-BFS vs DP
19
Quiz: Diameter Methods
20
LeetCode 543 Diameter of Binary Tree - Problem Statement
21
LeetCode 543 Diameter of Binary Tree - Core Idea
22
LeetCode 543 Diameter of Binary Tree - Algorithm
23
LeetCode 543 Diameter of Binary Tree - Implementation
24
LeetCode 543 Diameter of Binary Tree - Lessons
25
Tree Center
26
Finding the Center
27
Center via Diameter
28
Tree Eccentricity and Radius
29
Quiz: Tree Center
30
CSES 1132 Tree Distances I - Problem Statement
31
CSES 1132 Tree Distances I - Core Idea
32
CSES 1132 Tree Distances I - Algorithm
33
CSES 1132 Tree Distances I - Implementation
34
CSES 1132 Tree Distances I - Walkthrough
35
CSES 1132 Tree Distances I - Lessons
36
CSES 1133 Tree Distances II - Problem Statement
37
CSES 1133 Tree Distances II - Core Idea
38
CSES 1133 Tree Distances II - Algorithm
39
CSES 1133 Tree Distances II - Implementation
40
CSES 1133 Tree Distances II - Walkthrough
41
CSES 1133 Tree Distances II - Lessons
42
Quiz: Sum of Distances
43
Comparing the Problems
44
Common Mistakes
45
Section Recap
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
7.1
Intro
3 minutes
100%
Tasks
Read Unit