oxilean_std/graph_algorithms/mod.rs
1//! Advanced graph algorithms module.
2//!
3//! Provides algorithms beyond basic graph traversal: shortest paths with negative weights,
4//! max-flow / min-cut, bipartite matching (Hopcroft-Karp), MST (Kruskal + Prim),
5//! Tarjan's SCC, topological sort, bipartiteness check, and greedy chromatic approximation.
6
7pub mod functions;
8pub mod types;
9
10pub use functions::*;
11pub use types::*;