Returns true if the digraph has an Eulerian path.
true if the digraph has an Eulerian path; false otherwise.
Returns the sequence of vertices on an Eulerian path.
the sequence of vertices on an Eulerian path; empty collection if no such path.
Generated using TypeDoc
The
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.For additional documentation, see Section 4.2 of Algorithms, 4th Edition by Robert Sedgewick and Kevin Wayne.