Struct MinCutResult 

pub struct MinCutResult {
    pub source_side: AHashSet<i64>,
    pub sink_side: AHashSet<i64>,
    pub cut_edges: Vec<(i64, i64)>,
    pub cut_size: usize,
}

Result of minimum s-t edge cut computation.

Represents the minimum set of edges whose removal disconnects the source from the target in a directed graph.

Fields

• source_side: Nodes reachable from source in the residual graph (after max-flow)
• sink_side: All other nodes (complement of source_side)
• cut_edges: Edges crossing from source_side to sink_side (the minimum cut)
• cut_size: Number of edges in the minimum cut (equals max flow value)

Example

let graph = SqliteGraph::open_in_memory()?;
// ... build graph ...
let result = min_st_cut(&graph, 1, 5)?;

println!("Source side: {:?}", result.source_side);
println!("Sink side: {:?}", result.sink_side);
println!("Cut edges (remove these to disconnect): {:?}", result.cut_edges);
println!("Cut size: {} (min edges to remove)", result.cut_size);

Fields

source_side: AHashSet<i64>

Source side of the cut (nodes reachable from source in residual graph)

sink_side: AHashSet<i64>

Sink side of the cut (all other nodes)

cut_edges: Vec<(i64, i64)>

Edges crossing the cut (from source_side to sink_side)

cut_size: usize

Number of edges in the minimum cut

Trait Implementations

impl Clone for MinCutResult

fn clone(&self) -> MinCutResult

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Debug for MinCutResult

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl PartialEq for MinCutResult

fn eq(&self, other: &MinCutResult) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl Eq for MinCutResult

impl StructuralPartialEq for MinCutResult