public class DirectedEulerianPath extends Object
DirectedEulerianPathclass represents a data type for finding an Eulerian path in a digraph. An Eulerian path is a path (not necessarily simple) that uses every edge in the digraph exactly once.
This implementation uses a nonrecursive depth-first search. The constructor take Θ(E + V) time in the worst case, where E is the number of edges and V is the number of vertices. It uses Θ(V) extra space (not including the digraph).
For additional documentation, see Section 4.2 of Algorithms, 4th Edition by Robert Sedgewick and Kevin Wayne.
|Constructor and Description|
Computes an Eulerian path in the specified digraph, if one exists.
|Modifier and Type||Method and Description|
Returns true if the digraph has an Eulerian path.
Unit tests the
Returns the sequence of vertices on an Eulerian path.
public DirectedEulerianPath(Digraph G)
G- the digraph
nullif no such path
public boolean hasEulerianPath()
trueif the digraph has an Eulerian path;
public static void main(String args)
args- the command-line arguments