Ford-fulkerson

Network Flow Concepts — Max Flow and Min Cut Overview

Introduction to network flow: max flow problem, Ford-Fulkerson algorithm with BFS (Edmonds-Karp), max-flow min-cut theorem, and applications in matching and connectivity.