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

 EXTRA_DIST += \

 	demo/CMakeLists.txt \

 	demo/digraph.lgf

 if WANT_DEMO

 noinst_PROGRAMS += \

 	demo/arg_parser_demo \

 	demo/graph_to_eps_demo \

 	demo/lgf_demo

 endif WANT_DEMO

 demo_arg_parser_demo_SOURCES = demo/arg_parser_demo.cc

 demo_graph_to_eps_demo_SOURCES = demo/graph_to_eps_demo.cc

 demo_lgf_demo_SOURCES = demo/lgf_demo.cc