Expand description
Breadth-first search algorithm.
BFS computes shortest path distances from source nodes to all reachable nodes. The parallel version uses frontier-based expansion suitable for GPU execution.
Structs§
- BfsConfig
- BFS configuration.
Functions§
- bfs_
parallel - Parallel BFS implementation (frontier-based).
- bfs_
parallel_ with_ config - Parallel BFS with configuration.
- bfs_
sequential - Sequential BFS implementation.
- bfs_
sequential_ with_ config - Sequential BFS with configuration.
- bfs_
with_ parents - Multi-source BFS returning parent pointers for path reconstruction.
- reconstruct_
path - Reconstruct path from source to target using parent pointers.