Expand description
Breadth-First Search (BFS) algorithm implementation.
Provides functions for graph traversal, distance calculation, and path reconstruction.
Functionsยง
- bfs_
distances - Returns distances from the start node to all reachable nodes.
- bfs_
predecessors - Returns predecessor map for path reconstruction.
- bfs_
traverse - Returns nodes in BFS visit order from the start node.