public class KruskalMinimumSpanningTree<V,E>
extends java.lang.Object
Constructor and Description |
---|
KruskalMinimumSpanningTree(Graph<V,E> graph)
Creates and executes a new KruskalMinimumSpanningTree algorithm instance.
|
Modifier and Type | Method and Description |
---|---|
java.util.Set<E> |
getEdgeSet()
Returns the edges making up the tree found.
|
double |
getSpanningTreeCost()
Returns the cost of the minimum spanning tree or forest.
|
public KruskalMinimumSpanningTree(Graph<V,E> graph)
graph
- the graph to be searchedpublic java.util.Set<E> getEdgeSet()
public double getSpanningTreeCost()