COIN-OR::LEMON - Graph Library

source: lemon-1.1/test/CMakeLists.txt @ 391:624e673efa76

Last change on this file since 391:624e673efa76 was 327:91d63b8b1a4c, checked in by Balazs Dezso <deba@…>, 16 years ago

Several improvements in maximum matching algorithms

  • The interface of MaxMatching? is changed to be similar to the weighted algorithms
  • The internal data structure (the queue implementation and the matching map) is changed in the MaxMatching? algorithm, which provides better runtime properties
  • The Blossom iterators are changed slightly in the weighted matching algorithms
  • Several documentation improvments
  • The test files are merged
File size: 542 bytes
RevLine 
[225]1INCLUDE_DIRECTORIES(${CMAKE_SOURCE_DIR})
[141]2
[225]3LINK_DIRECTORIES(${CMAKE_BINARY_DIR}/lemon)
[141]4
[225]5SET(TESTS
[141]6  bfs_test
7  counter_test
8  dfs_test
9  digraph_test
[170]10  dijkstra_test
[141]11  dim_test
12  error_test
[200]13  graph_copy_test
[141]14  graph_test
[171]15  graph_utils_test
[203]16  heap_test
[141]17  kruskal_test
18  maps_test
[326]19  max_matching_test
[225]20  random_test
[171]21  path_test
[141]22  time_measure_test
23  unionfind_test)
24
[225]25FOREACH(TEST_NAME ${TESTS})
26  ADD_EXECUTABLE(${TEST_NAME} ${TEST_NAME}.cc)
27  TARGET_LINK_LIBRARIES(${TEST_NAME} lemon)
28  ADD_TEST(${TEST_NAME} ${TEST_NAME})
29ENDFOREACH(TEST_NAME)
Note: See TracBrowser for help on using the repository browser.