tools/CMakeLists.txt
author Peter Kovacs <kpeter@inf.elte.hu>
Thu, 12 Nov 2009 23:26:13 +0100
changeset 872 fa6f37d7a25b
parent 596 ba659d676331
permissions -rw-r--r--
Entirely rework CapacityScaling (#180)

- Use the new interface similarly to NetworkSimplex.
- Rework the implementation using an efficient internal structure
for handling the residual network. This improvement made the
code much faster (up to 2-5 times faster on large graphs).
- Handle GEQ supply type (LEQ is not supported).
- Handle negative costs for arcs of finite capacity.
(Note that this algorithm cannot handle arcs of negative cost
and infinite upper bound, thus it returns UNBOUNDED if such
an arc exists.)
- Extend the documentation.
alpar@574
     1
INCLUDE_DIRECTORIES(
ladanyi@596
     2
  ${PROJECT_SOURCE_DIR}
ladanyi@596
     3
  ${PROJECT_BINARY_DIR}
alpar@574
     4
)
alpar@574
     5
ladanyi@726
     6
LINK_DIRECTORIES(
ladanyi@726
     7
  ${PROJECT_BINARY_DIR}/lemon
ladanyi@726
     8
)
alpar@574
     9
alpar@574
    10
ADD_EXECUTABLE(lgf-gen lgf-gen.cc)
alpar@574
    11
TARGET_LINK_LIBRARIES(lgf-gen lemon)
alpar@574
    12
alpar@574
    13
ADD_EXECUTABLE(dimacs-to-lgf dimacs-to-lgf.cc)
alpar@574
    14
TARGET_LINK_LIBRARIES(dimacs-to-lgf lemon)
alpar@574
    15
alpar@574
    16
ADD_EXECUTABLE(dimacs-solver dimacs-solver.cc)
alpar@574
    17
TARGET_LINK_LIBRARIES(dimacs-solver lemon)
alpar@574
    18
alpar@574
    19
INSTALL(
alpar@574
    20
  TARGETS lgf-gen dimacs-to-lgf dimacs-solver
alpar@574
    21
  RUNTIME DESTINATION bin
alpar@574
    22
  COMPONENT bin
alpar@574
    23
)
alpar@574
    24
alpar@574
    25
IF(NOT WIN32)
alpar@574
    26
  INSTALL(
ladanyi@596
    27
    PROGRAMS ${CMAKE_CURRENT_SOURCE_DIR}/lemon-0.x-to-1.x.sh
ladanyi@596
    28
    DESTINATION bin
ladanyi@726
    29
    COMPONENT bin
ladanyi@726
    30
  )
ladanyi@726
    31
ENDIF()