Package org.jgrapht.alg.spanning
Spanning tree and spanner algorithms.

Class Summary Class Description AbstractCapacitatedMinimumSpanningTree<V,E> This is an abstract class for capacitated minimum spanning tree algorithms.AhujaOrlinSharmaCapacitatedMinimumSpanningTree<V,E> Implementation of an algorithm for the capacitated minimum spanning tree problem using a cyclic exchange neighborhood, based on Ravindra K.BoruvkaMinimumSpanningTree<V,E> BorÅ¯vka's algorithm for the computation of a minimum spanning tree.EsauWilliamsCapacitatedMinimumSpanningTree<V,E> Implementation of a randomized version of the EsauWilliams heuristic, a greedy randomized adaptive search heuristic (GRASP) for the capacitated minimum spanning tree (CMST) problem.GreedyMultiplicativeSpanner<V,E> Greedy algorithm for $(2k1)$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.