Detect Cycles in Directed Graphs

A directed cycle means dependencies loop back on themselves. Spotting one tells you no topological order or valid schedule can exist.

Cycle detection here is about direction. Following edges the wrong way does not count, so undirected tricks do not apply.