Lecture 14: Ford–Fulkerson and Maximum Flow

Content locked

The catalog is public. Reading this content requires approved access.

Directed cuts and capacities

Feasible flows

Every cut bounds every flow

Residual networks: record possible changes

Worked residual example

Augmenting paths

Why cancelling flow matters

Ford–Fulkerson

No augmenting path means optimality

Runtime and integrality

Bad path choices

Application: bipartite matching

Slide credits