pub type Mincut = StMincut;Expand description
Result of the global minimum cut computation.
Contains the cut value, edge IDs forming the cut, and the two vertex partitions.
Aliased Type§
pub struct Mincut {
pub value: f64,
pub cut: Vec<u32>,
pub partition: Vec<u32>,
pub partition2: Vec<u32>,
}Fields§
§value: f64Capacity of the minimum source → target cut. Equals the
scalar value returned by st_mincut_value /
max_flow_value within 1e-12.
cut: Vec<u32>Edge ids (in graph’s ecount-order) whose removal disconnects
source from target. Sum of capacities equals value.
partition: Vec<u32>Source-side partition S (vertices reachable from source in
the residual network after saturation). Always contains
source. Sorted ascending.
partition2: Vec<u32>Sink-side partition V \ S. Always contains target (unless
target is itself unreachable from source even before any
flow is pushed, in which case the empty cut suffices). Sorted
ascending.