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.

 INCLUDE_DIRECTORIES(

   ${PROJECT_SOURCE_DIR}

   ${PROJECT_BINARY_DIR}

 )

 LINK_DIRECTORIES(

   ${PROJECT_BINARY_DIR}/lemon

 )

 SET(DEMOS

   arg_parser_demo

   graph_to_eps_demo

   lgf_demo

 )

 FOREACH(DEMO_NAME ${DEMOS})

   ADD_EXECUTABLE(${DEMO_NAME} ${DEMO_NAME}.cc)

   TARGET_LINK_LIBRARIES(${DEMO_NAME} lemon)

 ENDFOREACH()