Package org.graph4j.spanning
Class MinimumSpanningTreeBase
java.lang.Object
org.graph4j.GraphAlgorithm
org.graph4j.spanning.MinimumSpanningTreeBase
- All Implemented Interfaces:
MinimumSpanningTreeAlgorithm
- Direct Known Subclasses:
BoruvkaMinimumSpanningTreeBase,KruskalMinimumSpanningTree,PrimMinimumSpanningTree
public abstract class MinimumSpanningTreeBase
extends GraphAlgorithm
implements MinimumSpanningTreeAlgorithm
Base class for minimum spanning tree algorithms.
- Author:
- Cristian Frăsinaru
-
Field Summary
FieldsFields inherited from class org.graph4j.GraphAlgorithm
directed, graph -
Constructor Summary
Constructors -
Method Summary
Methods inherited from class org.graph4j.GraphAlgorithm
getGraph
-
Field Details
-
tree
-
treeEdges
-
minWeight
-
-
Constructor Details
-
MinimumSpanningTreeBase
-
-
Method Details
-
getWeight
public double getWeight()- Specified by:
getWeightin interfaceMinimumSpanningTreeAlgorithm- Returns:
- the minimum weight of a spanning tree.
-
getEdges
- Specified by:
getEdgesin interfaceMinimumSpanningTreeAlgorithm- Returns:
- the edges of the minimum spanning tree.
-
getTree
Description copied from interface:MinimumSpanningTreeAlgorithmIf the graph is disconnected, this is actually a spanning forest.- Specified by:
getTreein interfaceMinimumSpanningTreeAlgorithm- Returns:
- a graph representing the minimum spanning tree.
-
compute
protected abstract void compute()
-