Max-Flow Min-Cut

The graph and algorithm ideas needed to understand the theorem equating maximum flow with minimum cut.

Topics on this path

1. Big-O Notation
2. Graph Terminology & Representations
3. Graph Connectivity
4. Graph Traversal (BFS and DFS)
5. Max-Flow Min-Cut