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.
Computes an Eulerian cycle in the specified digraph, if one exists.
the digraph
Generated using TypeDoc
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.