Module graph 

Graph representation for dynamic minimum cut

Provides an adjacency-based graph structure optimized for:

• O(1) edge existence queries
• O(deg(v)) neighbor iteration
• Efficient edge insertion/deletion
• Support for weighted edges

Structs

DynamicGraph

Dynamic graph structure for minimum cut algorithm

Edge

An edge in the graph

GraphStats

Statistics about the graph

Type Aliases

EdgeId

Unique edge identifier

VertexId

Unique vertex identifier

Weight

Edge weight type