DirectedSimpleCycles (JGraphT : a free Java graph library)

Type Parameters:

V - the vertex type.

E - the edge type.

All Known Implementing Classes:

HawickJamesSimpleCycles, JohnsonSimpleCycles, SzwarcfiterLauerSimpleCycles, TarjanSimpleCycles, TiernanSimpleCycles
```
public interface DirectedSimpleCycles<V,E>
```
A common interface for classes implementing algorithms for enumeration of the simple cycles of a directed graph.

Author:

Nikolay Ognyanov

- Method Summary
  
  All Methods Instance Methods Abstract Methods
  Modifier and Type Method Description
  
  java.util.List<java.util.List<V>> findSimpleCycles()
  Find the simple cycles of the graph.

- Method Detail
  - findSimpleCycles
```
java.util.List<java.util.List<V>> findSimpleCycles()
```
    Find the simple cycles of the graph.
    
    Returns:
    
    The list of all simple cycles. Possibly empty but never null.