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(FindPackageHandleStandardArgs)

 FIND_PROGRAM(GHOSTSCRIPT_EXECUTABLE

   NAMES gs gswin32c

   PATHS "$ENV{ProgramFiles}/gs"

   PATH_SUFFIXES gs8.61/bin gs8.62/bin gs8.63/bin gs8.64/bin gs8.65/bin

   DOC "Ghostscript: PostScript and PDF language interpreter and previewer."

 )

 FIND_PACKAGE_HANDLE_STANDARD_ARGS(Ghostscript DEFAULT_MSG GHOSTSCRIPT_EXECUTABLE)