demo/CMakeLists.txt
author Peter Kovacs <kpeter@inf.elte.hu>
Thu, 06 Aug 2009 20:12:43 +0200
changeset 760 83ce7ce39f21
parent 627 20dac2104519
permissions -rw-r--r--
Rework and fix the implementation of MinMeanCycle (#179)

- Fix the handling of the cycle means.
- Many implementation improvements:
- More efficient data storage for the strongly connected
components.
- Better handling of BFS queues.
- Merge consecutive BFS searches (perform two BFS searches
instead of three).

This version is about two times faster on average and an order of
magnitude faster if there are a lot of strongly connected components.
ladanyi@510
     1
INCLUDE_DIRECTORIES(
ladanyi@549
     2
  ${PROJECT_SOURCE_DIR}
ladanyi@510
     3
  ${PROJECT_BINARY_DIR}
ladanyi@510
     4
)
ladanyi@141
     5
ladanyi@679
     6
LINK_DIRECTORIES(
ladanyi@679
     7
  ${PROJECT_BINARY_DIR}/lemon
ladanyi@679
     8
)
ladanyi@141
     9
alpar@225
    10
SET(DEMOS
ladanyi@141
    11
  arg_parser_demo
ladanyi@141
    12
  graph_to_eps_demo
ladanyi@679
    13
  lgf_demo
ladanyi@679
    14
)
ladanyi@141
    15
alpar@225
    16
FOREACH(DEMO_NAME ${DEMOS})
alpar@225
    17
  ADD_EXECUTABLE(${DEMO_NAME} ${DEMO_NAME}.cc)
alpar@225
    18
  TARGET_LINK_LIBRARIES(${DEMO_NAME} lemon)
ladanyi@679
    19
ENDFOREACH()