cmake/FindGhostscript.cmake
author Peter Kovacs <kpeter@inf.elte.hu>
Thu, 15 Nov 2012 07:17:48 +0100
changeset 1013 f6f6896a4724
parent 225 c5a40fc54f1a
permissions -rw-r--r--
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.
     1 INCLUDE(FindPackageHandleStandardArgs)
     2 
     3 FIND_PROGRAM(GHOSTSCRIPT_EXECUTABLE
     4   NAMES gs gswin32c
     5   PATHS "$ENV{ProgramFiles}/gs"
     6   PATH_SUFFIXES gs8.61/bin gs8.62/bin gs8.63/bin gs8.64/bin gs8.65/bin
     7   DOC "Ghostscript: PostScript and PDF language interpreter and previewer."
     8 )
     9 
    10 FIND_PACKAGE_HANDLE_STANDARD_ARGS(Ghostscript DEFAULT_MSG GHOSTSCRIPT_EXECUTABLE)