Struct DynamicMinCut 

pub struct DynamicMinCut { /* private fields */ }

The main dynamic minimum cut structure

Implementations

impl DynamicMinCut

pub fn new(config: MinCutConfig) -> Self

Create a new dynamic minimum cut structure

pub fn from_graph(graph: DynamicGraph, config: MinCutConfig) -> Result<Self>

Build from an existing graph

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 min_cut_value(&self) -> f64

Get the current minimum cut value (O(1))

pub fn min_cut(&self) -> MinCutResult

Get detailed minimum cut result

pub fn partition(&self) -> (Vec<VertexId>, Vec<VertexId>)

Get the cut partition

pub fn cut_edges(&self) -> Vec<Edge>

Get edges in the minimum cut

pub fn is_connected(&self) -> bool

Check if graph is connected

pub fn stats(&self) -> AlgorithmStats

Get algorithm statistics

pub fn reset_stats(&mut self)

Reset statistics

pub fn config(&self) -> &MinCutConfig

Get configuration

pub fn graph(&self) -> Arc<RwLock<DynamicGraph>>

Get reference to underlying graph

pub fn num_vertices(&self) -> usize

Number of vertices

pub fn num_edges(&self) -> usize

Number of edges