Module org.jgrapht.core

Package org.jgrapht.alg.interfaces

Interface SpanningTreeAlgorithm<E>

Type Parameters:

E - the graph edge type

All Known Implementing Classes:

BoruvkaMinimumSpanningTree, KruskalMinimumSpanningTree, PrimMinimumSpanningTree

public interface SpanningTreeAlgorithm<E>

An algorithm which computes a spanning tree of a given connected graph. In the case of disconnected graphs it would rather derive a spanning forest.

Nested Class Summary

Nested Classes

Modifier and Type	Interface	Description
static interface	SpanningTreeAlgorithm.SpanningTree<E>	A spanning tree.
static class	SpanningTreeAlgorithm.SpanningTreeImpl<E>	Default implementation of the spanning tree interface.

Method Summary

Modifier and Type	Method	Description
SpanningTreeAlgorithm.SpanningTree<E>	getSpanningTree()	Computes a spanning tree.

Method Details

getSpanningTree

SpanningTreeAlgorithm.SpanningTree<E> getSpanningTree()

Computes a spanning tree.

Returns:

a spanning tree