Porting of max_weighted_matching

I have a JavaScript version of the `max_weighted_matching` procedure [here](https://github.com/aureooms/js-gn/blob/master/js/src/undirected/offline/algo/eulerian/wblossom_n3.js). It is not a port of the NetworkX version but of the original implementation made by Joris van Rantwijk. I do not know if this can help.

Start by reviewing the repository's existing graph-algorithm structure and the linked JavaScript implementation of max_weighted_matching. Compare its behavior with the corresponding NetworkX or original procedure, then determine the repository's expected entry point and tests; done means the procedure is integrated and its matching results are covered by tests.

Written by the indexing model from the issue text.