Expand description
Minimum Spanning Tree algorithms.
Structs§
- MinSpanning
Tree - An iterator producing a minimum spanning forest of a graph. It will first iterate all Node elements from original graph, then iterate Edge elements from computed minimum spanning forest.
- MinSpanning
Tree Prim - An iterator producing a minimum spanning tree of a graph. It will first iterate all Node elements from original graph, then iterate Edge elements from computed minimum spanning tree.
Functions§
- min_
spanning_ tree - [Generic] Compute a minimum spanning tree of a graph.
- min_
spanning_ tree_ prim - [Generic] Compute a minimum spanning tree of a graph using Prim’s algorithm.