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.

 #define LEMON_VERSION "@PROJECT_VERSION@"

 #cmakedefine LEMON_HAVE_LONG_LONG 1

 #cmakedefine LEMON_HAVE_LP 1

 #cmakedefine LEMON_HAVE_MIP 1

 #cmakedefine LEMON_HAVE_GLPK 1

 #cmakedefine LEMON_HAVE_CPLEX 1

 #cmakedefine LEMON_HAVE_CLP 1

 #cmakedefine LEMON_HAVE_CBC 1

 #cmakedefine LEMON_USE_PTHREAD 1

 #cmakedefine LEMON_USE_WIN32_THREADS 1