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.

#!/bin/bash

for((i=1;i<50;i++))

do

    echo -n $i ''

    edge_lookup 100 $i

done