demo/CMakeLists.txt
author Peter Kovacs <kpeter@inf.elte.hu>
Fri, 17 Apr 2009 18:04:36 +0200
changeset 609 e6927fe719e6
parent 473 17d918051964
child 549 ba659d676331
permissions -rw-r--r--
Support >= and <= constraints in NetworkSimplex (#219, #234)

By default the same inequality constraints are supported as by
Circulation (the GEQ form), but the LEQ form can also be selected
using the problemType() function.

The documentation of the min. cost flow module is reworked and
extended with important notes and explanations about the different
variants of the problem and about the dual solution and optimality
conditions.
ladanyi@473
     1
INCLUDE_DIRECTORIES(
ladanyi@473
     2
  ${CMAKE_SOURCE_DIR}
ladanyi@473
     3
  ${CMAKE_BINARY_DIR}
ladanyi@473
     4
)
ladanyi@141
     5
alpar@225
     6
LINK_DIRECTORIES(${CMAKE_BINARY_DIR}/lemon)
ladanyi@141
     7
alpar@225
     8
SET(DEMOS
ladanyi@141
     9
  arg_parser_demo
ladanyi@141
    10
  graph_to_eps_demo
ladanyi@141
    11
  lgf_demo)
ladanyi@141
    12
alpar@225
    13
FOREACH(DEMO_NAME ${DEMOS})
alpar@225
    14
  ADD_EXECUTABLE(${DEMO_NAME} ${DEMO_NAME}.cc)
alpar@225
    15
  TARGET_LINK_LIBRARIES(${DEMO_NAME} lemon)
alpar@225
    16
ENDFOREACH(DEMO_NAME)