Module graph_algorithms 

Advanced graph algorithms module.

Provides algorithms beyond basic graph traversal: shortest paths with negative weights, max-flow / min-cut, bipartite matching (Hopcroft-Karp), MST (Kruskal + Prim), Tarjan’s SCC, topological sort, bipartiteness check, and greedy chromatic approximation.

Re-exports

pub use functions::*;

pub use types::*;

Modules

functions

Advanced graph algorithm implementations.

types

Types for advanced graph algorithms.