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.
3 make VERSION=r`svn info|grep 'Revision:'|cut -d ' ' -f 2` $*