SpanningTreeAlgorithm.SpanningTree (JGraphT : a free Java graph library)

Type Parameters:

E - the graph edge type

All Superinterfaces:

Iterable<E>

All Known Subinterfaces:

CapacitatedSpanningTreeAlgorithm.CapacitatedSpanningTree<V,E>

All Known Implementing Classes:

CapacitatedSpanningTreeAlgorithm.CapacitatedSpanningTreeImpl, SpanningTreeAlgorithm.SpanningTreeImpl

Enclosing interface:

SpanningTreeAlgorithm<E>
```
public static interface SpanningTreeAlgorithm.SpanningTree<E>
extends Iterable<E>
```
A spanning tree.

Method Summary

All Methods Instance Methods Abstract Methods Default Methods
Modifier and Type	Method	Description
`Set<E>`	`getEdges()`	Set of edges of the spanning tree.
`double`	`getWeight()`	Returns the weight of the spanning tree.
`default Iterator<E>`	`iterator()`	Returns an iterator over the edges in the spanning tree.

Methods inherited from interface java.lang.Iterable
forEach, spliterator

- Method Detail
  - getWeight
```
double getWeight()
```
    Returns the weight of the spanning tree.
    
    Returns:
    
    weight of the spanning tree
  - getEdges
```
Set<E> getEdges()
```
    Set of edges of the spanning tree.
    
    Returns:
    
    edge set of the spanning tree
  - iterator
```
default Iterator<E> iterator()
```
    Returns an iterator over the edges in the spanning tree.
    
    Specified by:
    
    iterator in interface Iterable<E>
    
    Returns:
    
    iterator over the edges in the spanning tree.