Module algorithm 

Core Dynamic Minimum Cut Algorithm

Provides the main algorithm with:

• O(n^{o(1)}) amortized update time
• Support for edge insertions and deletions
• Both exact and approximate modes

Modules

• replacement: Replacement edge index for tree edge deletions
• approximate: (1+ε)-approximate min-cut for all cut sizes (SODA 2025)

Re-exports

pub use replacement::ReplacementEdgeIndex;

pub use replacement::ReplacementIndexStats;

Modules

approximate

Approximate Min-Cut for All Cut Sizes

replacement

Replacement edge data structure for O(log n) reconnection

Structs

AlgorithmStats

Statistics about algorithm performance

DynamicMinCut

The main dynamic minimum cut structure

MinCutBuilder

Builder for DynamicMinCut

MinCutConfig

Configuration for the minimum cut algorithm

MinCutResult

Result of a minimum cut query