Module flow
contest_algorithms::graph
Maximum flows, matchings, and minimum cuts.
Representation of a network flow problem with (optional) costs.