Crate graph_spanning 

graph-spanning

Minimum spanning tree and connectivity algorithms built on graph_core’s Graph trait.

Algorithms

Module	Algorithm	Complexity
disjoint_set	Union-Find with path compression	O(α(n))
kruskal	Kruskal’s MST	O(E log E)
prim	Prim’s MST	O((V+E) log V)
bridges	Tarjan’s bridge finding	O(V+E)
articulation	Articulation points (cut vertices)	O(V+E)

Re-exports

pub use articulation::articulation_points;

pub use bridges::bridges;

pub use disjoint_set::DisjointSet;

pub use kruskal::kruskal;

pub use kruskal::SpanningTree;

pub use prim::prim;

Modules

articulation

Articulation points (cut vertices) via DFS disc/low-link values.

bridges

Bridge finding (cut edges) via Tarjan’s DFS disc/low-link algorithm.

disjoint_set

Union-Find with union-by-rank and path compression.

kruskal

Kruskal’s minimum spanning tree: sort edges, union-find cycle check.

prim

Prim’s minimum spanning tree: priority-queue edge relaxation.