minimum_cut

scirs2_graph::algorithms::flow

Function minimum_cut 

Source 
pub fn minimum_cut<N, E, Ix>(
    graph: &Graph<N, E, Ix>,
) -> Result<(f64, Vec<bool>)>
where
    N: Node + Clone + Debug,
    E: EdgeWeight + Into<f64> + Copy + Debug,
    Ix: IndexType,
Expand description

Find minimum cut in a graph using global min-cut algorithm