Expand description
Graph operations using GraphBackend trait
Backend-agnostic implementations of shortest path, SCC, topological sort.
Structs§
- SccResult
- Result of strongly connected components computation.
Functions§
- bfs
- BFS traversal that returns nodes at exactly the specified depth.
- shortest_
path - Finds the shortest path between two nodes using BFS.
- strongly_
connected_ components - Computes strongly connected components using Tarjan’s algorithm.
- topological_
sort - Performs topological sort using Kahn’s algorithm.