Maximum flow and minimum cut algorithms for network flow problems.

Provides the Edmonds-Karp algorithm for computing maximum flow in a flow network, and the max-flow min-cut theorem for extracting minimum cuts.

Stoer-Wagner global minimum cut algorithm.

Finds the minimum weight cut that partitions the graph into two non-empty sets, without specifying which nodes must be on which side (unlike s-t min cut).

Network Simplex algorithm for minimum cost flow problems.

⚠️ EXPERIMENTAL - This implementation is incomplete. The pivot logic is not fully implemented, causing the algorithm to return Infeasible for most feasible problems. Use with caution or consider alternative minimum cost flow algorithms.

Solves the minimum cost flow problem: find the cheapest way to send flow through a network satisfying supply/demand constraints at nodes.