networkop/max_flow_min_cut library
Maximum Flow (Dinic) and Minimum s-t Cut utilities
High-performance Dinic implementation with level graph and blocking flow. Designed for reproducible, deterministic runs and clear, auditable behavior suitable for benchmarks and production simulations.
API:
- Dinic(n) where n is the number of integer vertices
0..n-1 - addEdge(u,v,capacity)
- maxFlow(s,t) -> returns numeric max flow
- minCut(s) -> returns Set