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