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 + Hash + Eq,
    E: EdgeWeight + Into<f64> + Clone,
    Ix: IndexType,
Expand description

Finds a minimum cut in a graph using Karger’s algorithm

Returns the minimum cut value and a partition of nodes. This is a randomized algorithm, so multiple runs may give different results.