Module graphalgs::mst

Minimum spanning tree (MST) algorithms.

The kruskal function is a reimported min_spanning_tree function from the ‘petgraph’ crate.

Functions

boruvka

Borůvka’s algorithm for computing a minimum spanning tree of a graph.

kruskal

[Generic] Compute a minimum spanning tree of a graph.

prim

Prim’s algorithm for computing a minimum spanning tree of a graph.