Struct SubpolynomialMinCut 

pub struct SubpolynomialMinCut { /* private fields */ }

The main subpolynomial dynamic minimum cut structure

Implementations

impl SubpolynomialMinCut

pub fn new(config: SubpolyConfig) -> Self

Create new subpolynomial min-cut structure

pub fn for_size(expected_n: usize) -> Self

Create with config optimized for expected graph size

pub fn insert_edge( &mut self, u: VertexId, v: VertexId, weight: Weight, ) -> Result<f64>

Insert an edge

pub fn delete_edge(&mut self, u: VertexId, v: VertexId) -> Result<f64>

Delete an edge

pub fn build(&mut self)

Build the multi-level hierarchy

This creates O(log^{1/4} n) levels of expander decomposition, enabling subpolynomial update time.

pub fn min_cut_value(&self) -> f64

Get the current minimum cut value

pub fn min_cut(&self) -> MinCutQueryResult

Get detailed minimum cut result

pub fn config(&self) -> &SubpolyConfig

Get configuration

pub fn num_vertices(&self) -> usize

Get number of vertices

pub fn num_edges(&self) -> usize

Get number of edges

pub fn num_levels(&self) -> usize

Get number of hierarchy levels

pub fn recourse_stats(&self) -> &RecourseStats

Get recourse statistics

pub fn hierarchy_stats(&self) -> HierarchyStatistics

Get hierarchy statistics

pub fn is_subpolynomial(&self) -> bool

Check if updates are subpolynomial

pub fn certify_cuts(&mut self)

Certify cuts using LocalKCut verification

Trait Implementations

impl Debug for SubpolynomialMinCut

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

Formats the value using the given formatter.