Expand description
Minimum spanning tree algorithms.
Re-exports§
pub use boruvka::boruvka_mst;pub use kruskal::kruskal_mst;pub use prim::prim_mst;pub use union_find::UnionFind;
Modules§
- boruvka
- Borůvka’s MST: parallel-friendly contraction.
- kruskal
- Kruskal’s MST: sort edges, then Union-Find.
- prim
- Prim’s MST algorithm with binary heap.
- union_
find - Disjoint Set Union (Union-Find) with path compression and union by rank.