org.jgrapht.alg

## Class EulerianCircuit

• Deprecated.

```@Deprecated
public abstract class EulerianCircuit
extends Object```
This algorithm will check whether a graph is Eulerian (hence it contains an Eulerian circuit). Also, if a graph is Eulerian, the caller can obtain a list of vertices making up the Eulerian circuit. An Eulerian circuit is a circuit which traverses each edge exactly once.
Since:
Dec 21, 2008
Author:
Andrew Newell
• ### Constructor Summary

Constructors
Constructor and Description
`EulerianCircuit()`
Deprecated.

• ### Method Summary

All Methods
Modifier and Type Method and Description
`static <V,E> List<V>` `getEulerianCircuitVertices(UndirectedGraph<V,E> g)`
Deprecated.
This method will return a list of vertices which represents the Eulerian circuit of the graph.
`static <V,E> boolean` `isEulerian(UndirectedGraph<V,E> graph)`
Deprecated.
Test whether a graph is Eulerian.
• ### Methods inherited from class java.lang.Object

`clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait`
• ### Constructor Detail

• #### EulerianCircuit

`public EulerianCircuit()`
Deprecated.
• ### Method Detail

• #### isEulerian

`public static <V,E> boolean isEulerian(UndirectedGraph<V,E> graph)`
Deprecated.
Test whether a graph is Eulerian. An undirected graph is Eulerian if it is connected and each vertex has an even degree.
Type Parameters:
`V` - the graph vertex type
`E` - the graph edge type
Parameters:
`graph` - the input graph
Returns:
true if the graph is Eulerian, false otherwise
• #### getEulerianCircuitVertices

`public static <V,E> List<V> getEulerianCircuitVertices(UndirectedGraph<V,E> g)`
Deprecated.
This method will return a list of vertices which represents the Eulerian circuit of the graph.
Type Parameters:
`V` - the graph vertex type
`E` - the graph edge type
Parameters:
`g` - The graph to find an Eulerian circuit
Returns:
null if no Eulerian circuit exists, or a list of vertices representing the Eulerian circuit if one does exist