Rare
0/5
Maximum Flow
Author: Benjamin Qi
Introduces maximum flow as well as flow with lower bounds.
Status | Source | Problem Name | Difficulty | Tags | |
---|---|---|---|---|---|
CSES | Easy | Show TagsMax Flow |
Resources
Flows
Status | Source | Problem Name | Difficulty | Tags | |
---|---|---|---|---|---|
CSES | Easy | Show TagsMax Flow |
Bipartite Matching
Status | Source | Problem Name | Difficulty | Tags | |
---|---|---|---|---|---|
CSES | Easy | Show TagsMax Flow |
Dinic's Algorithm
Status | Source | Problem Name | Difficulty | Tags | |
---|---|---|---|---|---|
SPOJ | Easy | ||||
YS | Easy |
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!