Loading repovive.com/roadmaps/graph-theory
Roadmaps
Graph Theory
Network Flow
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
1
Intro
2
Flow Networks
3
Flow Assignment
4
Example Flow
5
The Max Flow Problem
6
Residual Graph
7
Augmenting Path
8
Quiz: Residual Graph
9
Ford-Fulkerson Method
10
Why It Works
11
Edmonds-Karp Algorithm
12
Pseudocode - Edmonds-Karp
13
Residual Capacity Update
14
Implementation Details
15
Time Complexity
16
Quiz: Edmonds-Karp Complexity
17
Problem - Download Speed
18
Download Speed - Modeling
19
Download Speed - Implementation
20
Download Speed - Walkthrough
21
Download Speed - Edge Cases
22
Cuts and Capacity
23
Min-Cut
24
Max-Flow Min-Cut Theorem
25
Finding the Min-Cut
26
Quiz: Max-Flow Min-Cut Theorem
27
Problem - Police Chase
28
Police Chase - Core Idea
29
Police Chase - Extracting the Cut
30
Police Chase - Implementation
31
Police Chase - Walkthrough
32
Bipartite Matching
33
Problem - School Dance
34
School Dance - Graph Construction
35
School Dance - Extracting Pairs
36
School Dance - Implementation
37
School Dance - Walkthrough
38
School Dance - Edge Cases
39
Quiz: Bipartite Matching via Flow
40
Multiple Sources and Sinks
41
Vertex Capacities
42
Flow with Lower Bounds
43
Integer Flow Theorem
44
Disjoint Paths
45
When to Use Flow
46
Common Mistakes
47
Quiz: Node Capacity Modeling
48
Faster Algorithms
49
Flow in Practice
50
Vocabulary - Augmenting Path
51
Vocabulary - Residual Graph
52
Vocabulary - Cut
53
Practice Tips
54
Section Recap
Maximum Bipartite Matching
0/50
Minimum Cut
0/47
Euler Paths and Circuits
0/37
Mixed Practice: Advanced Graphs
0/24
33.1
Intro
3 minutes
100%
Tasks
Read Unit