EulerianCycleAlgorithm (JGraphT : a free Java graph library)

Type Parameters:

V - the graph vertex type

E - the graph edge type

All Known Implementing Classes:

HierholzerEulerianCycle
```
public interface EulerianCycleAlgorithm<V,E>
```
Computes an Eulerian cycle of an Eulerian graph. An Eulerian graph is a graph containing an Eulerian cycle.

Author:

Dimitrios Michail

- Method Summary
  
  All Methods Instance Methods Abstract Methods
  Modifier and Type Method Description
  
  GraphPath<V,E> getEulerianCycle(Graph<V,E> graph)
  Compute an Eulerian cycle of a graph.

- Method Detail
  - getEulerianCycle
```
GraphPath<V,E> getEulerianCycle(Graph<V,E> graph)
```
    Compute an Eulerian cycle of a graph.
    
    Parameters:
    
    graph - the input graph
    
    Returns:
    
    an Eulerian cycle
    
    Throws:
    
    java.lang.IllegalArgumentException - in case the graph is not Eulerian