Function rs_graph::maxflow::edmondskarp
[−]
[src]
pub fn edmondskarp<'a, 'b, G, F>(
g: &'a G,
src: G::Node,
snk: G::Node,
upper: &EdgeSlice<'a, 'b, G, F>
) -> (F, EdgeVec<'a, G, F>, Vec<G::Node>) where
G: IndexNetwork<'a>,
F: NumAssign + Ord + Copy,
Solve the maxflow problem using the algorithm of Edmonds-Karp.