Package org.graph4j.spanning

Class ParallelFilterKruskal

java.lang.Object

org.graph4j.GraphAlgorithm

org.graph4j.spanning.ParallelFilterKruskal

All Implemented Interfaces:

MinimumSpanningTreeAlgorithm

public class ParallelFilterKruskal
extends GraphAlgorithm
implements MinimumSpanningTreeAlgorithm

Parallel implementation of the Filter-Kruskal algorithm for finding a minimum spanning tree. (see https://en.wikipedia.org/wiki/Parallel_algorithms_for_minimum_spanning_trees#Approach_2:_Filter-Kruskal). Filtering and partitioning are parallelized.

Author:

Ioana-Larisa Cioată

Field Summary

Fields inherited from class org.graph4j.GraphAlgorithm

directed, graph

Constructor Summary

Constructors

Constructor	Description
ParallelFilterKruskal(Graph graph)

Method Summary

Modifier and Type	Method	Description
EdgeSet	getEdges()
Graph	getTree()	If the graph is disconnected, this is actually a spanning forest.
double	getWeight()

Methods inherited from class org.graph4j.GraphAlgorithm

getGraph

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Details

ParallelFilterKruskal

public ParallelFilterKruskal(Graph graph)

Method Details

getTree

public Graph getTree()

Description copied from interface: MinimumSpanningTreeAlgorithm

If the graph is disconnected, this is actually a spanning forest.

Specified by:

getTree in interface MinimumSpanningTreeAlgorithm

Returns:

a graph representing the minimum spanning tree.

getWeight

public double getWeight()

Specified by:

getWeight in interface MinimumSpanningTreeAlgorithm

Returns:

the minimum weight of a spanning tree.

getEdges

public EdgeSet getEdges()

Specified by:

getEdges in interface MinimumSpanningTreeAlgorithm

Returns:

the edges of the minimum spanning tree.