Documentation of 'org.jgrapht.alg.KruskalMinimumSpanningTree' Java class
KruskalMinimumSpanningTree
org.jgrapht.alg

Class KruskalMinimumSpanningTree<V,E>

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

    Deprecated. 

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

DataMelt 3.0 © DataMelt by jWork.ORG

You see the box below because you did not login.