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
13
14
15
//! Max flow / min cut algorithms.

pub mod dinic;
pub mod edmonds_karp;
pub mod min_cut;
pub mod parametric_maxflow;
pub mod push_relabel;

pub use dinic::dinic_max_flow;
pub use edmonds_karp::edmonds_karp;
pub use min_cut::min_cut_from_max_flow;
pub use parametric_maxflow::{
    ParametricArc, ParametricBreakpoint, ParametricMaxFlow, ParametricSolution,
};
pub use push_relabel::push_relabel_max_flow;