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

//! Min-cost max-flow algorithms.

pub mod successive_shortest_paths;

pub use successive_shortest_paths::{
    MinCostFlowNetwork, MinCostFlowResult, min_cost_flow_bounded, min_cost_max_flow,
};