Groups
Category
Many classic problems can be modeled as a maximum flow problem by building the right network and capacities.
The Max-Flow Min-Cut Theorem says the maximum amount you can push from source to sink equals the minimum total capacity you must cut to disconnect them.