edu.princeton.cs.algs4

## Class DirectedEulerianCycle

• Object
• edu.princeton.cs.algs4.DirectedEulerianCycle

• ```public class DirectedEulerianCycle
extends Object```
The `DirectedEulerianCycle` class represents a data type for finding an Eulerian cycle or path in a digraph. An Eulerian cycle is a cycle (not necessarily simple) that uses every edge in the digraph exactly once.

This implementation uses a nonrecursive depth-first search. The constructor runs in O(E + V) time, and uses O(V) extra space, where E is the number of edges and V the number of vertices All other methods take O(1) time.

To compute Eulerian paths in digraphs, see `DirectedEulerianPath`. To compute Eulerian cycles and paths in undirected graphs, see `EulerianCycle` and `EulerianPath`.

For additional documentation, see Section 4.2 of Algorithms, 4th Edition by Robert Sedgewick and Kevin Wayne.

Author:
Robert Sedgewick, Kevin Wayne, Nate Liu
• ### Constructor Summary

Constructors
Constructor and Description
`DirectedEulerianCycle(Digraph G)`
Computes an Eulerian cycle in the specified digraph, if one exists.
• ### Method Summary

Methods
Modifier and Type Method and Description
`Iterable<Integer>` `cycle()`
Returns the sequence of vertices on an Eulerian cycle.
`boolean` `hasEulerianCycle()`
Returns true if the digraph has an Eulerian cycle.
`static void` `main(String[] args)`
Unit tests the `DirectedEulerianCycle` data type.
• ### Methods inherited from class Object

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

• #### DirectedEulerianCycle

`public DirectedEulerianCycle(Digraph G)`
Computes an Eulerian cycle in the specified digraph, if one exists.
Parameters:
`G` - the digraph
• ### Method Detail

• #### cycle

`public Iterable<Integer> cycle()`
Returns the sequence of vertices on an Eulerian cycle.
Returns:
the sequence of vertices on an Eulerian cycle; `null` if no such cycle
• #### hasEulerianCycle

`public boolean hasEulerianCycle()`
Returns true if the digraph has an Eulerian cycle.
Returns:
`true` if the digraph has an Eulerian cycle; `false` otherwise
• #### main

`public static void main(String[] args)`
Unit tests the `DirectedEulerianCycle` data type.
Parameters:
`args` - the command-line arguments