=== rpcs3-0001: std::find for every predecessor insertion — O(P) per edge where P = ===
N=100   k=100  : defective=0.097ms  fixed=0.004ms  speedup=24.0x
N=500   k=500  : defective=2.513ms  fixed=0.024ms  speedup=105.6x
N=1000  k=1000 : defective=10.363ms  fixed=0.053ms  speedup=196.6x
N=2000  k=2000 : defective=36.369ms  fixed=0.095ms  speedup=382.5x

=== rpcs3-0002: scanning the vector with std::find before each push_back — O(C) per ===
N=100   k=100  : defective=0.155ms  fixed=0.007ms  speedup=23.4x
N=500   k=500  : defective=2.240ms  fixed=0.021ms  speedup=108.8x
N=1000  k=1000 : defective=9.187ms  fixed=0.045ms  speedup=203.0x
N=2000  k=2000 : defective=44.070ms  fixed=0.107ms  speedup=413.0x

=== rpcs3-0003: CWE-407: list-scan inside loop in rpcs3-0003 (generic model) ===
N=100   k=100  : defective=0.093ms  fixed=0.004ms  speedup=24.9x
N=500   k=500  : defective=2.304ms  fixed=0.023ms  speedup=100.3x
N=1000  k=1000 : defective=8.557ms  fixed=0.046ms  speedup=186.7x
N=2000  k=2000 : defective=35.494ms  fixed=0.118ms  speedup=302.0x

=== rpcs3-0004: Defect: rpcs3-0004 ===
N=100   k=100  : defective=0.103ms  fixed=0.004ms  speedup=25.3x
N=500   k=500  : defective=2.717ms  fixed=0.025ms  speedup=108.4x
N=1000  k=1000 : defective=10.659ms  fixed=0.047ms  speedup=224.5x
N=2000  k=2000 : defective=35.404ms  fixed=0.095ms  speedup=372.0x

