Package org.graph4j.spanning
Class BoruvkaMinimumSpanningTreeDefault
java.lang.Object
org.graph4j.GraphAlgorithm
org.graph4j.spanning.MinimumSpanningTreeBase
org.graph4j.spanning.BoruvkaMinimumSpanningTreeBase
org.graph4j.spanning.BoruvkaMinimumSpanningTreeDefault
- All Implemented Interfaces:
MinimumSpanningTreeAlgorithm
Boruvka algorithm for finding a minimum spanning tree.
You can see more : https://en.wikipedia.org/wiki/Bor%C5%AFvka%27s_algorithm
- Author:
- Sorodoc Cosmin
-
Field Summary
Fields inherited from class org.graph4j.spanning.BoruvkaMinimumSpanningTreeBase
cheapest, ufFields inherited from class org.graph4j.spanning.MinimumSpanningTreeBase
minWeight, tree, treeEdgesFields inherited from class org.graph4j.GraphAlgorithm
directed, graph -
Constructor Summary
Constructors -
Method Summary
Modifier and TypeMethodDescriptionprotected booleanFor each component, find the smallest weighted edge and update the cheapest arrayMethods inherited from class org.graph4j.spanning.BoruvkaMinimumSpanningTreeBase
computeMethods inherited from class org.graph4j.spanning.MinimumSpanningTreeBase
getEdges, getTree, getWeightMethods inherited from class org.graph4j.GraphAlgorithm
getGraph
-
Constructor Details
-
BoruvkaMinimumSpanningTreeDefault
-
-
Method Details
-
updateCheapestEdges
protected boolean updateCheapestEdges()For each component, find the smallest weighted edge and update the cheapest array- Specified by:
updateCheapestEdgesin classBoruvkaMinimumSpanningTreeBase- Returns:
- true if there is at least one outgoing edge from the components, false otherwise
-