tools/CMakeLists.txt
author Peter Kovacs <kpeter@inf.elte.hu>
Thu, 12 Nov 2009 23:26:13 +0100
changeset 806 fa6f37d7a25b
parent 549 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@527
     1
INCLUDE_DIRECTORIES(
ladanyi@549
     2
  ${PROJECT_SOURCE_DIR}
ladanyi@549
     3
  ${PROJECT_BINARY_DIR}
alpar@527
     4
)
alpar@527
     5
ladanyi@679
     6
LINK_DIRECTORIES(
ladanyi@679
     7
  ${PROJECT_BINARY_DIR}/lemon
ladanyi@679
     8
)
alpar@527
     9
alpar@527
    10
ADD_EXECUTABLE(lgf-gen lgf-gen.cc)
alpar@527
    11
TARGET_LINK_LIBRARIES(lgf-gen lemon)
alpar@527
    12
alpar@527
    13
ADD_EXECUTABLE(dimacs-to-lgf dimacs-to-lgf.cc)
alpar@527
    14
TARGET_LINK_LIBRARIES(dimacs-to-lgf lemon)
alpar@527
    15
alpar@527
    16
ADD_EXECUTABLE(dimacs-solver dimacs-solver.cc)
alpar@527
    17
TARGET_LINK_LIBRARIES(dimacs-solver lemon)
alpar@527
    18
alpar@527
    19
INSTALL(
alpar@527
    20
  TARGETS lgf-gen dimacs-to-lgf dimacs-solver
alpar@527
    21
  RUNTIME DESTINATION bin
alpar@527
    22
  COMPONENT bin
alpar@527
    23
)
alpar@527
    24
alpar@527
    25
IF(NOT WIN32)
alpar@527
    26
  INSTALL(
ladanyi@549
    27
    PROGRAMS ${CMAKE_CURRENT_SOURCE_DIR}/lemon-0.x-to-1.x.sh
ladanyi@549
    28
    DESTINATION bin
ladanyi@679
    29
    COMPONENT bin
ladanyi@679
    30
  )
ladanyi@679
    31
ENDIF()