isap_max_flow

scirs2_graph::algorithms::flow

Function isap_max_flow 

Source 
pub fn isap_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

ISAP (Improved Shortest Augmenting Path) algorithm for maximum flow