SpanningTreeAlgorithm (JGraphT : a free Java graph library)

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

All Methods Instance Methods Abstract Methods
Modifier and Type Method Description

SpanningTreeAlgorithm.SpanningTree<E> getSpanningTree()
Computes a spanning tree.

- Method Detail
  - getSpanningTree
```
SpanningTreeAlgorithm.SpanningTree<E> getSpanningTree()
```
    Computes a spanning tree.
    
    Returns:
    
    a spanning tree