edmonds_karp_max_flow

scirs2_graph::algorithms::flow

Function edmonds_karp_max_flow 

Source 
pub fn edmonds_karp_max_flow<N, E, Ix>(
    graph: &DiGraph<N, E, Ix>,
    source: &N,
    sink: &N,
) -> Result<f64>
where
    N: Node + Clone + Debug,
    E: EdgeWeight + Into<f64> + Copy + Debug,
    Ix: IndexType,
Expand description

Edmonds-Karp algorithm for maximum flow (Ford-Fulkerson with BFS)