Class KruskalMinimumSpanningTree<V,​E>

  • Type Parameters:
    V - the graph vertex type
    E - the graph edge type
    All Implemented Interfaces:

    public class KruskalMinimumSpanningTree<V,​E>
    extends Object
    implements SpanningTreeAlgorithm<E>
    An implementation of Kruskal's minimum spanning tree algorithm. If the given graph is connected it computes the minimum spanning tree, otherwise it computes the minimum spanning forest. The algorithm runs in time $O(E \log E)$. This implementation uses the hashCode and equals method of the vertices.
    Tom Conerly