CycleBasisAlgorithm (JGraphT : a free Java graph library)

Type Parameters:

V - vertex the graph vertex type

E - edge the graph edge type

All Known Implementing Classes:

AbstractFundamentalCycleBasis, PatonCycleBase, QueueBFSFundamentalCycleBasis, StackBFSFundamentalCycleBasis
```
public interface CycleBasisAlgorithm<V,E>
```
Allows to derive an undirected cycle basis of a given graph.
Note that undirected cycle bases are defined for both undirected and directed graphs. For a discussion of different kinds of cycle bases in graphs see the following paper.
- Christian Liebchen, and Romeo Rizzi. Classes of Cycle Bases. Discrete Applied Mathematics, 155(3), 337-355, 2007.
Author:

Dimitrios Michail

Nested Class Summary

Nested Classes
Modifier and Type	Interface	Description
`static interface`	`CycleBasisAlgorithm.CycleBasis<V,E>`	An undirected cycle basis.
`static class`	`CycleBasisAlgorithm.CycleBasisImpl<V,E>`	Default implementation of the undirected cycle basis interface.

Method Summary

All Methods Instance Methods Abstract Methods
Modifier and Type	Method	Description
`CycleBasisAlgorithm.CycleBasis<V,E>`	`getCycleBasis()`	Return a list of cycles forming an undirected cycle basis of a graph.

- Method Detail
  - getCycleBasis
```
CycleBasisAlgorithm.CycleBasis<V,E> getCycleBasis()
```
    Return a list of cycles forming an undirected cycle basis of a graph.
    
    Returns:
    
    an undirected cycle basis