oxicuda-graphalg 0.3.0

OxiCUDA: Classical graph algorithms (BFS/DFS, shortest paths, MST, max-flow, matching, SCC, centrality, community, TSP, coloring, isomorphism)
Documentation
//! Connectivity: strongly-connected components, bridges, articulation points, biconnected.

pub mod articulation_points;
pub mod biconnected;
pub mod bridges_tarjan;
pub mod k_core;
pub mod scc_gabow;
pub mod scc_kosaraju;
pub mod scc_tarjan;

pub use articulation_points::articulation_points;
pub use biconnected::biconnected_components;
pub use bridges_tarjan::bridges_tarjan;
pub use k_core::{
    KCoreResult, core_numbers, degeneracy, degeneracy_ordering, k_core_decomposition,
    k_core_subgraph,
};
pub use scc_gabow::scc_gabow;
pub use scc_kosaraju::scc_kosaraju;
pub use scc_tarjan::scc_tarjan;