Function rs_graph::maxflow::pushrelabel
source · pub fn pushrelabel<'a, G, F, Us>(
g: &'a G,
src: G::Node,
snk: G::Node,
upper: Us
) -> (F, IndexEdgeVec<'a, G, F>, Vec<G::Node>)where
G: IndexNetwork<'a>,
F: NumAssign + Ord + Copy,
Us: EdgeMap<'a, G, F>,
Expand description
Solve the maxflow problem using Dinic’ algorithm.