Maximum Flow

The most flow that can be pushed from source to sink given edge capacities.

Expert

Ford-Fulkerson / Edmonds-Karp ( $O(VE^2)$ ) or Dinic's algorithm. Models networks, pipelines and assignment problems.

Spotted a mistake or want to add detail? Suggest an improvement — Content Contributors' edits are reviewed by editors before they go live.

Discussion (0)