Rare
0/5
Maximum Flow
Author: Benjamin Qi
Prerequisites
Introduces maximum flow as well as flow with lower bounds.
Resources
| Resources | |||
|---|---|---|---|
| CPC | |||
| CPH | |||
| CP2 | |||
Flows
Bipartite Matching
Dinic's Algorithm
Hopcroft-Karp Bipartite Matching?
Optional: Faster Flow
There exist faster flow algorithms such as Push-Relabel. Also see the following blog post:
However, the standard implementation of Dinic's is (almost) always fast enough on reasonable problems.
Implementation
| Resources | |||
|---|---|---|---|
| Benq | |||
Breaking Flows
When the constraints are too high ...
Module Progress:
Join the USACO Forum!
Stuck on a problem, or don't understand a module? Join the USACO Forum and get help from other competitive programmers!