oxicuda_graphalg/flow/mod.rs
1//! Cut-structure algorithms built on max-flow / min-cut.
2//!
3//! - [`gomory_hu`] — the Gomory-Hu cut tree (Gusfield's `n − 1` max-flow construction),
4//! encoding every pairwise minimum cut of an undirected weighted graph.
5//! - [`stoer_wagner`] — the Stoer-Wagner global minimum cut, found without any max-flow
6//! computation via maximum adjacency ordering.
7
8pub mod gomory_hu;
9pub mod stoer_wagner;
10
11pub use gomory_hu::{GomoryHuTree, gomory_hu_tree};
12pub use stoer_wagner::{GlobalMinCut, stoer_wagner_min_cut};