scirs2_graph/flow/mod.rs
1//! Standalone network flow algorithms (integer-capacity, index-based API).
2//!
3//! This module provides high-performance, standalone flow algorithms that
4//! operate on integer capacities and node indices rather than the generic
5//! `Graph` type. They are used internally by other modules (e.g. hypergraph
6//! connectivity) and can be used directly for competitive-programming-style
7//! graph problems.
8//!
9//! ## Algorithms
10//!
11//! - [`max_flow::DinicMaxFlow`] -- Dinic's algorithm, O(V^2 E)
12//! - [`max_flow::PushRelabelMaxFlow`] -- Push-Relabel, O(V^2 sqrt(E))
13//! - [`max_flow::EdmondsKarp`] -- Edmonds-Karp (BFS Ford-Fulkerson), O(V E^2)
14//! - [`min_cost_flow::MinCostFlow`] -- SPFA successive shortest paths
15//! - [`min_cost_flow::PotentialMinCostFlow`] -- Johnson potentials + Dijkstra
16
17pub mod max_flow;
18pub mod min_cost_flow;