SteinerTreeAlgorithm (JGraphT : a free Java graph library)

Type Parameters:

V - the graph vertices type

E - the graph edge type

All Known Implementing Classes:

KouMarkowskyBermanAlgorithm
```
public interface SteinerTreeAlgorithm<V,E>
```
An algorithm which computes a Steiner tree of a given graph. A Steiner tree is a tree that connects a given set of vertices (called Steiner points or terminals) with minimum total weight, possibly using additional vertices not in the original set.

Nested Class Summary

Nested Classes
Modifier and Type	Interface	Description
`static interface`	`SteinerTreeAlgorithm.SteinerTree<E>`	A Steiner tree.
`static class`	`SteinerTreeAlgorithm.SteinerTreeImpl<E>`	Default implementation of the Steiner tree interface.

Method Summary

All Methods Instance Methods Abstract Methods
Modifier and Type Method Description

SteinerTreeAlgorithm.SteinerTree<E> getSteinerTree(Set<V> steinerPoints)
Computes a Steiner tree.

- Method Detail
  - getSteinerTree
```
SteinerTreeAlgorithm.SteinerTree<E> getSteinerTree(Set<V> steinerPoints)
```
    Computes a Steiner tree.
    
    Parameters:
    
    steinerPoints - the set of vertices (terminals) that must be connected by the Steiner tree
    
    Returns:
    
    a Steiner tree connecting all the specified vertices