Loading repovive.com/roadmaps/graph-theory
Roadmaps
Graph Theory
Minimum Cut
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
Minimum Cut
0/47
1
Intro
2
What is a Cut?
3
Cut Capacity
4
s-t Cut
5
Minimum s-t Cut
6
Max-Flow Min-Cut Theorem
7
Theorem Intuition
8
Quiz: Max-Flow Min-Cut Relationship
9
Finding the Min Cut
10
Algorithm - Find Min Cut
11
Why Residual Graph Works
12
Example - Finding Min Cut
13
Quiz: Finding Cut Edges
14
Global Minimum Cut
15
Stoer-Wagner Algorithm
16
Edge Connectivity
17
Vertex Connectivity
18
Application - Network Reliability
19
Application - Image Segmentation
20
Application - Clustering
21
Quiz: Stoer-Wagner Algorithm
22
Problem - Police Chase
23
Problem - Police Chase - Read Statement
24
Core Idea - Max Flow with Unit Capacities
25
Core Idea - Extracting the Cut Edges
26
Handling Bidirectional Roads
27
Implementation - Police Chase
28
Implementation - Police Chase - Implement Solution
29
Lessons - Min Cut Applications
30
Quiz: Vertex vs Edge Connectivity
31
Problem - Distinct Routes
32
Problem - Distinct Routes - Read Statement
33
Core Idea - Max Flow Equals Path Count
34
Core Idea - Flow Decomposition
35
Algorithm - Path Decomposition
36
Implementation - Distinct Routes
37
Implementation - Distinct Routes - Implement Solution
38
Lessons - Flow Decomposition
39
Problem - Network Segmentation
40
Core Idea - Try All Pairs
41
Core Idea - Stoer-Wagner Basics
42
Maximum Adjacency Ordering
43
Algorithm - Stoer-Wagner
44
Quiz: Maximum Adjacency Ordering
45
Implementation - Network Segmentation
46
Lessons - Global vs Local Cuts
47
Section Recap
Euler Paths and Circuits
0/37
Mixed Practice: Advanced Graphs
0/24
35.1
Intro
3 minutes
100%
Tasks
Read Unit