Module dynamic_mincut 

Dynamic Min-Cut Tracking for RuVector

Implementation based on El-Hayek, Henzinger, Li (SODA 2026) paper on subpolynomial dynamic min-cut algorithms.

Key components:

• Euler Tour Tree for O(log n) dynamic connectivity
• Dynamic cut watcher for continuous monitoring
• Local min-cut procedures (deterministic)
• Cut-gated HNSW search integration

Performance: O(log n) updates when λ (min-cut) is bounded by 2^{(log n)^{3/4}}

Structs

CutGatedSearch

HNSW search with cut-awareness

CutWatcherConfig

Configuration for the dynamic cut watcher

DynamicCutWatcher

Background process for continuous min-cut monitoring

EdgeUpdate

Edge update event

EulerTourTree

Euler Tour Tree for maintaining dynamic connectivity

HNSWGraph

Simplified HNSW graph structure for integration

LocalCut

Result of local cut computation

LocalMinCutProcedure

Deterministic local min-cut procedure

WatcherStats

Watcher statistics

Enums

DynamicMinCutError

Error types for dynamic min-cut operations

EdgeUpdateType