SzwarcfiterLauerSimpleCycles (JGraphT : a free Java graph library)

java.lang.Object
- org.jgrapht.alg.cycle.SzwarcfiterLauerSimpleCycles<V,E>

Type Parameters:

V - the vertex type.

E - the edge type.

All Implemented Interfaces:

DirectedSimpleCycles<V,E>
```
public class SzwarcfiterLauerSimpleCycles<V,E>
extends Object
implements DirectedSimpleCycles<V,E>
```
Find all simple cycles of a directed graph using the Schwarcfiter and Lauer's algorithm.
See:
J.L.Szwarcfiter and P.E.Lauer, Finding the elementary cycles of a directed graph in $O(n + m)$ per cycle, Technical Report Series, #60, May 1974, Univ. of Newcastle upon Tyne, Newcastle upon Tyne, England.

Author:

Nikolay Ognyanov

Constructor Summary

Constructors
Constructor	Description
`SzwarcfiterLauerSimpleCycles()`	Create a simple cycle finder with an unspecified graph.
`SzwarcfiterLauerSimpleCycles(Graph<V,E> graph)`	Create a simple cycle finder for the specified graph.

Method Summary

All Methods Instance Methods Concrete Methods
Modifier and Type	Method	Description
`List<List<V>>`	`findSimpleCycles()`	Find the simple cycles of the graph.
`Graph<V,E>`	`getGraph()`	Get the graph
`void`	`setGraph(Graph<V,E> graph)`	Set the graph

Methods inherited from class java.lang.Object
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

- Constructor Detail
  - SzwarcfiterLauerSimpleCycles
```
public SzwarcfiterLauerSimpleCycles()
```
    Create a simple cycle finder with an unspecified graph.
  - SzwarcfiterLauerSimpleCycles
```
public SzwarcfiterLauerSimpleCycles(Graph<V,E> graph)
```
    Create a simple cycle finder for the specified graph.
    
    Parameters:
    
    graph - - the DirectedGraph in which to find cycles.
    
    Throws:
    
    IllegalArgumentException - if the graph argument is null.
- Method Detail
  - getGraph
```
public Graph<V,E> getGraph()
```
    Get the graph
    
    Returns:
    
    graph
  - setGraph
```
public void setGraph(Graph<V,E> graph)
```
    Set the graph
    
    Parameters:
    
    graph - graph
  - findSimpleCycles
```
public List<List<V>> findSimpleCycles()
```
    Find the simple cycles of the graph.
    
    Specified by:
    
    findSimpleCycles in interface DirectedSimpleCycles<V,E>
    
    Returns:
    
    The list of all simple cycles. Possibly empty but never null.