TriColorVisitorlooks for back edges in a graph, which indicate that a cycle exists.
A “depth-first search” iterator for a directed graph.
A depth-first search that also tracks when all successors of a node have been examined.
The status of a node in the depth-first search.
What to do when a node is examined or becomes