Package org.apache.commons.graph.spanning

Minimum spanning tree (forest) algorithms implementation.

See:
Description

Class Summary

Boruvka	Boruvka's algorithm is an algorithm for finding a minimum spanning tree in a graph for which all edge weights are distinct.
Kruskal	Kruskal's algorithm is an algorithm in graph theory that finds a minimum spanning tree for a connected weighted graph.
Prim	Prim's algorithm is a greedy algorithm that finds a minimum spanning tree for a connected weighted undirected graph.

Package org.apache.commons.graph.spanning Description

Minimum spanning tree (forest) algorithms implementation.