| Class | Description | 
|---|---|
| BoruvkaMinimumSpanningTree<V,E> | Borůvka's algorithm for the computation of a minimum spanning tree. | 
| GreedyMultiplicativeSpanner<V,E> | Greedy algorithm for $(2k-1)$-multiplicative spanner construction (for any integer
 k >= 1). | 
| KruskalMinimumSpanningTree<V,E> | An implementation of Kruskal's minimum
 spanning tree algorithm. | 
| PrimMinimumSpanningTree<V,E> | An implementation of  Prim's
 algorithm that finds a minimum spanning tree/forest subject to connectivity of the supplied
 weighted undirected graph. | 
Copyright © 2018. All rights reserved.