DFS discovery and finishing times ($d(v),f(v)$)

A traversal clock incremented on each vertex discovery and finish records two times per vertex. The active recursion interval of an ancestor contains that of each descendant. A finished vertex has no unexamined outgoing edge. These facts constrain possible finishing orders even when traversal order is unspecified.