org.apache.commons.graph.spanning
Class Boruvka

java.lang.Object
  org.apache.commons.graph.spanning.Boruvka

public final class Boruvka
extends Object

Boruvka's algorithm is an algorithm for finding a minimum spanning tree in a graph for which all edge weights are distinct.

Constructor Summary

Boruvka()

Method Summary

static <V extends Vertex,WE extends WeightedEdge<V>> Graph<V,WE>

minimumSpanningTree(WeightedGraph<V,WE> graph) Calculates the minimum spanning tree (or forest) of the input Graph.

Methods inherited from class java.lang.Object

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

Constructor Detail

Boruvka

public Boruvka()

Method Detail

minimumSpanningTree

public static <V extends Vertex,WE extends WeightedEdge<V>> Graph<V,WE> minimumSpanningTree(WeightedGraph<V,WE> graph)

Calculates the minimum spanning tree (or forest) of the input Graph.

Type Parameters:

V - the Graph vertices type.

WE - the Graph weighted edges type.

Parameters:

graph - the Graph for which minimum spanning tree (or forest) has to be calculated.

Returns:

the minimum spanning tree (or forest) of the input Graph.