Loading repovive.com/roadmaps/graph-theory
Roadmaps
Graph Theory
Maximum Bipartite Matching
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
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
1
Intro
2
What Is a Matching
3
Maximum Matching
4
Perfect Matching
5
Augmenting Paths
6
Why Augmenting Paths Work
7
Finding Augmenting Paths
8
Quiz: Augmenting Paths in Matching
9
Kuhn's Algorithm
10
Kuhn's Algorithm - Pseudocode
11
Problem - School Dance
12
Problem - School Dance - Read Statement
13
School Dance - Core Idea
14
School Dance - Algorithm
15
School Dance - Implementation
16
School Dance - Walkthrough
17
School Dance - Lessons
18
Quiz: Kuhn's Algorithm Complexity
19
Reduction to Max Flow
20
Why Max Flow Works
21
König's Theorem
22
Proof Idea of König's Theorem
23
Hall's Marriage Theorem
24
Checking Hall's Condition
25
Quiz: Hall's Marriage Theorem
26
Application - Job Assignment
27
Application - Scheduling
28
Problem - Maximum Matching
29
Maximum Matching - Core Idea
30
Maximum Matching - Implementation
31
Maximum Matching - Walkthrough
32
Maximum Matching - Lessons
33
Problem - Assign Cookies
34
Assign Cookies - Greedy Solution
35
Assign Cookies - Matching Solution
36
Assign Cookies - Implementation
37
Assign Cookies - Lessons
38
Quiz: Konig's Theorem
39
Weighted Bipartite Matching
40
Online Bipartite Matching
41
Common Mistakes
42
Improvement - Early Termination
43
Hopcroft-Karp Algorithm
44
When to Use Each Algorithm
45
Minimum Vertex Cover from Matching
46
Minimum Edge Cover
47
Maximum Independent Set
48
Quiz: Matching and Independence
49
Checklist - Bipartite Matching
50
Section Recap
Minimum Cut
0/47
Euler Paths and Circuits
0/37
Mixed Practice: Advanced Graphs
0/24
34.1
Intro
3 minutes
100%
Tasks
Read Unit