PrimMinimumSpanningTree

java.lang.Object
- org.jgrapht.alg.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.
Use PrimMinimumSpanningTree instead.

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 Summary

Fields
Modifier and Type	Field	Description
`private java.util.Set<E>`	`minimumSpanningTreeEdgeSet`	Deprecated. Minimum Spanning-Tree/Forest edge set
`private double`	`minimumSpanningTreeTotalWeight`	Deprecated. Minimum Spanning-Tree/Forest edge set overall weight

Constructor Summary

Constructors
Constructor Description

PrimMinimumSpanningTree(Graph<V,E> g)
Deprecated.

Create and execute a new instance of Prim's algorithm.

Method Summary

All Methods Instance Methods Concrete Methods Deprecated Methods
Modifier and Type	Method	Description
`java.util.Set<E>`	`getMinimumSpanningTreeEdgeSet()`	Deprecated. Returns edges set constituting the minimum spanning tree/forest
`double`	`getMinimumSpanningTreeTotalWeight()`	Deprecated. Returns total weight of the minimum spanning tree/forest.

Methods inherited from class java.lang.Object
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

- 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
- Method Detail
  - getMinimumSpanningTreeEdgeSet
```
public java.util.Set<E> getMinimumSpanningTreeEdgeSet()
```
    Deprecated.
    
    Description copied from interface: MinimumSpanningTree
    
    Returns edges set constituting the minimum spanning tree/forest
    
    Specified by:
    
    getMinimumSpanningTreeEdgeSet in interface MinimumSpanningTree<V,E>
    
    Returns:
    
    minimum spanning-tree edges set
  - getMinimumSpanningTreeTotalWeight
```
public double getMinimumSpanningTreeTotalWeight()
```
    Deprecated.
    
    Description copied from interface: MinimumSpanningTree
    
    Returns total weight of the minimum spanning tree/forest.
    
    Specified by:
    
    getMinimumSpanningTreeTotalWeight in interface MinimumSpanningTree<V,E>
    
    Returns:
    
    minimum spanning-tree total weight