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

INCLUDE_DIRECTORIES(${CMAKE_SOURCE_DIR})

LINK_DIRECTORIES(${CMAKE_BINARY_DIR}/lemon)

SET(DEMOS

  arg_parser_demo

  graph_to_eps_demo

  lgf_demo)

FOREACH(DEMO_NAME ${DEMOS})

  ADD_EXECUTABLE(${DEMO_NAME} ${DEMO_NAME}.cc)

  TARGET_LINK_LIBRARIES(${DEMO_NAME} lemon)

ENDFOREACH(DEMO_NAME)