Ensure strongly polynomial running time for CycleCanceling (#436)
The number of iterations performed by Howard's algorithm is limited.
If the limit is reached, a strongly polynomial implementation,
HartmannOrlinMmc is executed to find a minimum mean cycle.
This iteration limit is typically not reached, thus the combined
method is practically equivalent to Howard's algorithm, while it
also ensures the strongly polynomial time bound.

 #!/bin/sh

 # Run in valgrind, with leak checking enabled

 valgrind -q --leak-check=full "$@" 2> .valgrind-log

 # Save the test result

 result="$?"

 # Valgrind should generate no error messages

 log_contents="`cat .valgrind-log`"

 if [ "$log_contents" != "" ]; then

         cat .valgrind-log >&2

         result=1

 fi

 rm -f .valgrind-log

 exit $result