Function minimum_cut 

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

Find minimum s-t cut using max flow.

The min-cut value equals the max flow (max-flow min-cut theorem). Returns the cut value and the partition of nodes.