Files
java-interview-lab/graph-algorithms/output/07-topological-random-agreement.txt
T

8 lines
276 B
Plaintext

Kahn and DFS vs a transitive-closure reference on seeded random graphs
======================================================================
cases checked : 3000
cases with a cycle : 2016
cases acyclic (orders valid): 984
disagreements : 0