benchmark/edge_lookup_test
author kpeter
Sun, 13 Jan 2008 10:26:55 +0000
changeset 2555 a84e52e99f57
permissions -rwxr-xr-x
Reimplemented MinMeanCycle to be much more efficient.
The new version implements Howard's algorithm instead of Karp's algorithm and
it is at least 10-20 times faster on all the 40-50 random graphs we have tested.
     1 #!/bin/bash
     2 
     3 for((i=1;i<50;i++))
     4 do
     5     echo -n $i ''
     6     edge_lookup 100 $i
     7 done