rust_igraph/algorithms/spanning/mod.rs
1//! Spanning-tree algorithms (ALGO-MST-*, ALGO-RST-*).
2//!
3//! Mirrors the upstream `igraph` C file
4//! [`references/igraph/src/misc/spanning_trees.c`](https://github.com/igraph/igraph/blob/main/src/misc/spanning_trees.c)
5//! which groups the deterministic minimum-spanning-tree variants
6//! (BFS-unweighted, Prim, Kruskal, automatic dispatch) and the
7//! loop-erased random-walk (LERW) random spanning tree.
8//!
9//! Currently hosts:
10//! - `mst` (`ALGO-MST-001`): [`minimum_spanning_tree`] — Prim / Kruskal /
11//! Unweighted / Automatic with a `Vec<EdgeId>` return type.
12//! - `random_spanning_tree` (`ALGO-RST-001`): [`random_spanning_tree`] —
13//! uniform spanning tree/forest via loop-erased random walk.
14
15pub(crate) mod mst;
16pub(crate) mod random_spanning_tree;
17
18pub use mst::{MstAlgorithm, minimum_spanning_tree};
19pub use random_spanning_tree::random_spanning_tree;