- Type Parameters:
public class MinimumSpanningForest2<V,E>
- extends Object
For the input Graph, creates a MinimumSpanningTree
using a variation of Prim's algorithm.
- Tom Nelson - firstname.lastname@example.org
create a Forest from the supplied Graph and supplied Factory, which
is used to create a new, empty Forest.
|Methods inherited from class java.lang.Object
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait
protected Graph<V,E> graph
protected Forest<V,E> forest
public MinimumSpanningForest2(Graph<V,E> graph,
- create a Forest from the supplied Graph and supplied Factory, which
is used to create a new, empty Forest. If non-null, the supplied root
will be used as the root of the tree/forest. If the supplied root is
null, or not present in the Graph, then an arbitary Graph vertex
will be selected as the root.
If the Minimum Spanning Tree does not include all vertices of the
Graph, then a leftover vertex is selected as a root, and another
tree is created
public Forest<V,E> getForest()
- Returns the generated forest.
Copyright © 2010 null. All Rights Reserved.