v0.1.4 · MIT OR Apache-2.0

graph-rs

A complete graph algorithm library built from scratch in Rust — 40+ algorithms across 8 crates, zero third-party graph dependencies.

8
crates
40+
algorithms
300+
tests
4
benchmarks
API documentation
Full rustdoc for all 8 crates — traits, structs, every public function with examples.
Benchmark report
Criterion HTML report — BFS, Dijkstra, Kruskal, Floyd-Warshall across graph sizes.
graph-collections
Stack, Queue, Deque, MinHeap, PriorityQueue, DisjointSet
graph-core
Graph trait, NodeId, AdjacencyList, AdjacencyMatrix, GraphBuilder
graph-traversal
DFS, BFS, topo sort, cycle detection, components, bipartite
graph-shortest-path
Dijkstra, Bellman-Ford, Floyd-Warshall, A*
graph-spanning
Kruskal, Prim, bridges, articulation points
graph-flow
Ford-Fulkerson, Edmonds-Karp, min-cut, Hopcroft-Karp
graph-advanced
Tarjan/Kosaraju SCC, condensation, Euler, Hamiltonian, TSP
graph
Meta-crate — re-exports everything via prelude::*