Files
java-interview-lab/graph-algorithms/output/10-union-find-random-agreement.txt

7 lines
223 B
Plaintext

Union-Find (all four strategies) vs BFS component count
=======================================================
cases checked : 2000
strategies : [NAIVE, BY_SIZE, COMPRESSION, BY_SIZE_AND_COMPRESSION]
disagreements : 0