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})

 ADD_LIBRARY(lemon

   arg_parser.cc

   base.cc

   color.cc

   random.cc)

 INSTALL(

   TARGETS lemon

   ARCHIVE DESTINATION lib

   COMPONENT library)

 INSTALL(

   DIRECTORY . bits concepts

   DESTINATION include/lemon

   COMPONENT headers

   FILES_MATCHING PATTERN "*.h")