edu.uci.ics.jung.algorithms.shortestpath
Class PrimMinimumSpanningTree<V,E>
- java.lang.Object
-
- edu.uci.ics.jung.algorithms.shortestpath.PrimMinimumSpanningTree<V,E>
-
-
Constructor Summary
Constructors Constructor and Description PrimMinimumSpanningTree(com.google.common.base.Supplier<? extends Graph<V,E>> supplier)Creates an instance which generates a minimum spanning tree assuming constant edge weights.PrimMinimumSpanningTree(com.google.common.base.Supplier<? extends Graph<V,E>> supplier, com.google.common.base.Function<? super E,java.lang.Double> weights)Creates an instance which generates a minimum spanning tree using the input edge weights.
-
Method Summary
All Methods Instance Methods Concrete Methods Modifier and Type Method and Description Graph<V,E>apply(Graph<V,E> graph)
-
-
-
Constructor Detail
-
PrimMinimumSpanningTree
public PrimMinimumSpanningTree(com.google.common.base.Supplier<? extends Graph<V,E>> supplier)
Creates an instance which generates a minimum spanning tree assuming constant edge weights.- Parameters:
supplier- used to create the tree instances
-
PrimMinimumSpanningTree
public PrimMinimumSpanningTree(com.google.common.base.Supplier<? extends Graph<V,E>> supplier, com.google.common.base.Function<? super E,java.lang.Double> weights)
Creates an instance which generates a minimum spanning tree using the input edge weights.- Parameters:
supplier- used to create the tree instancesweights- the edge weights to use for defining the MST
-
-
DataMelt 3.0 © DataMelt by jWork.ORG