Loading repovive.com/roadmaps/graph-theory
Roadmaps
Graph Theory
Minimum Spanning Trees
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
1
Intro
2
What is a Spanning Tree?
3
Minimum Spanning Tree (MST)
4
The Cut Property
5
The Cycle Property
6
Kruskal's Algorithm - Idea
7
Kruskal with Union-Find
8
Kruskal's Time Complexity
9
Kruskal's Algorithm - Pseudocode
10
Prim's Algorithm - Idea
11
Prim with Priority Queue
12
Prim's Time Complexity
13
Prim's Algorithm - Pseudocode
14
Kruskal vs Prim - When to Use Each
15
MST in Disconnected Graphs
16
Problem - Road Reparation
17
Problem - Read Statement
18
Core Idea - Check Connectivity
19
Core Idea - Kruskal is Perfect Here
20
Algorithm - Kruskal with Validation
21
Road Reparation - Implementation
22
Problem - Implement Solution
23
Walkthrough - Road Reparation
24
Lessons from Road Reparation
25
Problem - Min Cost to Connect All Points
26
Problem - Read Statement
27
Core Idea - Complete Graph
28
Core Idea - Manhattan Distance
29
Algorithm - Prim on Implicit Graph
30
Min Cost Connect - Implementation
31
Problem - Implement Solution
32
Walkthrough - Min Cost Connect
33
Lessons from Min Cost Connect
34
Problem - Building Roads
35
Problem - Read Statement
36
Core Idea - Find Components
37
Core Idea - Connect Component Representatives
38
Algorithm - Component Chaining
39
Building Roads - Implementation
40
Problem - Implement Solution
41
Walkthrough - Building Roads
42
Lessons from Building Roads
43
MST Uniqueness
44
Second-Best MST
45
MSTs in Practice
46
Quiz: Unique MST with Unique Weights
47
Quiz: Kruskal vs Prim on Dense Graphs
48
Section Recap
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
14.1
Intro
3 minutes
100%
Tasks
Read Unit