Function all_st_mincuts 

pub fn all_st_mincuts(
    graph: &Graph,
    source: VertexId,
    target: VertexId,
    capacity: Option<&[f64]>,
) -> IgraphResult<StMinCuts>

List all minimum (s,t) edge cuts of a directed graph (Provan-Shier).

Arguments

• graph — directed input graph. Undirected graphs are rejected.
• source — source vertex id.
• target — target vertex id (must differ from source).
• capacity — optional per-edge capacities in edge-id order. When None, every edge has unit capacity. All capacities must be strictly positive.

Errors

• IgraphError::InvalidArgument when graph is undirected, when source == target, when capacity.len() != ecount(), or when any capacity is not strictly positive.
• IgraphError::VertexOutOfRange when source or target is not a valid vertex id.

Examples

use rust_igraph::all_st_mincuts;
use rust_igraph::Graph;

// Path 0→1→2→3→4: the single min cut value is 1 and there are four
// distinct minimum cuts, one per edge.
let mut g = Graph::new(5, true).unwrap();
for (u, v) in [(0, 1), (1, 2), (2, 3), (3, 4)] {
    g.add_edge(u, v).unwrap();
}
let res = all_st_mincuts(&g, 0, 4, None).unwrap();
assert_eq!(res.value, 1.0);
assert_eq!(res.cuts.len(), 4);