Class PrimMinimumSpanningTree<V,​E>

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

    @Deprecated
    public class PrimMinimumSpanningTree<V,​E>
    extends java.lang.Object
    implements MinimumSpanningTree<V,​E>
    Deprecated.
    An implementation of Prim's algorithm that finds a minimum spanning tree/forest subject to connectivity of the supplied weighted undirected graph. The algorithm was developed by Czech mathematician V. Jarník and later independently by computer scientist Robert C. Prim and rediscovered by E. Dijkstra.
    Since:
    Mar 5, 2013
    • Field Detail

      • minimumSpanningTreeEdgeSet

        private final java.util.Set<E> minimumSpanningTreeEdgeSet
        Deprecated.
        Minimum Spanning-Tree/Forest edge set
      • minimumSpanningTreeTotalWeight

        private final double minimumSpanningTreeTotalWeight
        Deprecated.
        Minimum Spanning-Tree/Forest edge set overall weight
    • Constructor Detail

      • PrimMinimumSpanningTree

        public PrimMinimumSpanningTree​(Graph<V,​E> g)
        Deprecated.
        Create and execute a new instance of Prim's algorithm.
        Parameters:
        g - the input graph