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 cd ${0%update-libstd-tag}../doc
4 mv libstdc++.tag libstdc++.tag.old
5 wget http://gcc.gnu.org/onlinedocs/libstdc++/latest-doxygen/libstdc++.tag &&
6 rm libstdc++.tag.old || mv libstdc++.tag.old libstdc++.tag