oxicuda-graphalg 0.3.0

OxiCUDA: Classical graph algorithms (BFS/DFS, shortest paths, MST, max-flow, matching, SCC, centrality, community, TSP, coloring, isomorphism)
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12

//! 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.

pub mod gomory_hu;
pub mod stoer_wagner;

pub use gomory_hu::{GomoryHuTree, gomory_hu_tree};
pub use stoer_wagner::{GlobalMinCut, stoer_wagner_min_cut};