Explain the Ford-Fulkerson method for maximum flow.

Ford-Fulkerson finds maximum flow in a network by repeatedly finding augmenting paths from source to sink in residual graph and pushing flow along them. Residual graph contains remaining capacities and reverse edges for flow cancellation. Path finding strategy matters: DFS gives O(EF) where F is max flow (can be slow), BFS (Edmonds-Karp) gives O(VE^2). Applications: bipartite matching, network routing, image segmentation.