Struct ApproxMinCut 

pub struct ApproxMinCut { /* private fields */ }

Approximate minimum cut for all cut sizes

Achieves (1+ε)-approximation for any cut size using spectral sparsification.

Example

use ruvector_mincut::algorithm::approximate::ApproxMinCut;

let mut approx = ApproxMinCut::new(ApproxMinCutConfig::default());
approx.insert_edge(0, 1, 1.0);
approx.insert_edge(1, 2, 1.0);
approx.insert_edge(2, 0, 1.0);

let result = approx.min_cut();
assert!(result.value >= 2.0 * 0.9); // (1-ε) lower bound

Implementations

impl ApproxMinCut

pub fn new(config: ApproxMinCutConfig) -> Self

Create new approximate min-cut structure

pub fn with_epsilon(epsilon: f64) -> Self

Create with default configuration

pub fn insert_edge(&mut self, u: VertexId, v: VertexId, weight: f64)

Insert an edge

pub fn delete_edge(&mut self, u: VertexId, v: VertexId)

Delete an edge

pub fn min_cut(&mut self) -> ApproxMinCutResult

Query approximate minimum cut

pub fn min_cut_value(&mut self) -> f64

Get minimum cut value only

pub fn is_connected(&self) -> bool

Check if graph is connected

pub fn vertex_count(&self) -> usize

Get vertex count

pub fn edge_count(&self) -> usize

Get edge count

pub fn stats(&self) -> &ApproxMinCutStats

Get statistics

Trait Implementations

impl Debug for ApproxMinCut

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

Formats the value using the given formatter.

impl Default for ApproxMinCut

fn default() -> Self

Returns the “default value” for a type.