The previous implementation, based on the original blossom-shrinking
algorithm by Edmonds/Gabow, is still available as
MAX_CARD_MATCHING_EDMONDS
and a variant based on a heuristic by J. Kececioglu and J. Pecquer as
MAX_CARD_MATCHING_KECECIOGLUsee here
The new algorithm can also be called explicitely as
MAX_CARD_MATCHING_GABOW.
Compile and run the program
LEDAROOT/app/speed/mc_matching.cpp
for a comparison of the efficiency of the different matching algorithms.
This program can also be started from the online demo page
leda.uni-trier.de/leda/demos?speed/mc_matching