An one-file and short C++ implementation of Micali and Vazirani (1980) algorithm for finding maximum cardinality matching in general graphs.
Simply compile matching.cpp file (at least c++11 needed) and run in on given tests.
For implementation details, check comments in code.