Expand description
Graph algorithms.
This module provides parallel graph algorithms:
bfs: Breadth-first searchscc: Strongly connected componentsunion_find: Disjoint set data structure- [
spmv]: Sparse matrix-vector multiplication
Re-exports§
pub use bfs::bfs_parallel;pub use bfs::bfs_sequential;pub use bfs::BfsConfig;pub use scc::scc_kosaraju;pub use scc::scc_tarjan;pub use scc::SccConfig;pub use spmv::spmv;pub use spmv::spmv_parallel;pub use spmv::SpmvConfig;pub use union_find::union_find_parallel;pub use union_find::union_find_sequential;pub use union_find::UnionFind;
Modules§
- bfs
- Breadth-first search algorithm.
- scc
- Strongly Connected Components (SCC) algorithms.
- spmv
- Sparse Matrix-Vector Multiplication (SpMV).
- union_
find - Union-Find (Disjoint Set) data structure.