Author: Benjamin Qi
Introduces maximum flow as well as flow with lower bounds.
Hopcroft-Karp Bipartite Matching?
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.
When the constraints are too high ...