I know of edmond's blossom v algorithm but i didn't understand it but i have a python implementation. do u know about drake and hougardy simple approximation algorithm for the weighted matching problem? I want to know more about it but I fear my understanding of academic papers and pseudocode is far ahead me because I don't have that background hence I'm looking for a simple explanation or an implementation in php, c, javascript or basic. Thank u!

Originally asked by: epitaph on Stack Overflow