Module flow 

Cut-structure algorithms built on max-flow / min-cut.

• gomory_hu — the Gomory-Hu cut tree (Gusfield’s n − 1 max-flow construction), encoding every pairwise minimum cut of an undirected weighted graph.
• stoer_wagner — the Stoer-Wagner global minimum cut, found without any max-flow computation via maximum adjacency ordering.

Re-exports

pub use gomory_hu::GomoryHuTree;

pub use gomory_hu::gomory_hu_tree;

pub use stoer_wagner::GlobalMinCut;

pub use stoer_wagner::stoer_wagner_min_cut;

Modules

gomory_hu

Gomory-Hu cut tree (Gusfield’s 1990 simplified construction).

stoer_wagner

Stoer-Wagner global minimum cut.