Weighted B-Matching

Any plans on implementation of [Blossom V](https://pub.ista.ac.at/~vnk/papers/blossom5.pdf) or another b-matching algorithm?
I need to use it in my project. Although I can download Vladimir's code, I'd be happy to see it in Boost.
Looks like it is not difficult to rewrite using Boost.Graph codebase. So, the question is: why is it not there yet? I may try to submit a PR if someone else wants it in Boost.