Performs a cycle detection while edges are added. You must call
the methods when edges are added etc. as described in @see CycleDetector.
Based on the paper
A Dynamic Topological Sort Algorithm for Directed Acyclic Graphs
DAVID J. PEARCE / PAUL H. J. KELLY
Journal of Experimental Algorithmics (JEA)
Volume 11, 2006, Article No. 1.7
ACM New York, NY, USA
Performs a cycle detection while edges are added. You must call the methods when edges are added etc. as described in @see CycleDetector.
CycleDetector