Class KruskalMinimumSpanningTree<V,​E>

  • Type Parameters:
    V - the graph vertex type
    E - the graph edge type
    All Implemented Interfaces:
    MinimumSpanningTree<V,​E>

    @Deprecated
    public class KruskalMinimumSpanningTree<V,​E>
    extends java.lang.Object
    implements MinimumSpanningTree<V,​E>
    Deprecated.
    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.
    Since:
    Feb 10, 2010
    • Field Detail

      • spanningTreeCost

        private double spanningTreeCost
        Deprecated.
      • edgeList

        private java.util.Set<E> edgeList
        Deprecated.
    • Constructor Detail

      • KruskalMinimumSpanningTree

        public KruskalMinimumSpanningTree​(Graph<V,​E> graph)
        Deprecated.
        Creates and executes a new KruskalMinimumSpanningTree algorithm instance. An instance is only good for a single spanning tree; after construction, it can be accessed to retrieve information about the spanning tree found.
        Parameters:
        graph - the graph to be searched