An exception that is raised when an assumed DAG has a cycle
Represents common behavior of all directed graphs
A class that represents an Euler Tour of a directed graph from a given root.
A class that represents an Euler Tour of a directed graph from a
given root. This requires O(n)
preprocessing time to generate
the initial Euler Tour.
An exception that is raised when attempting to find an unreachable node