Function rs_graph::maxflow::pushrelabel

pub fn pushrelabel<'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 Dinic' algorithm.