Hello, i want to use an algorithm called  MaxWeightedMatching : Edmond's blossom shrinking algorithm for calculating maximum weighted matching in general graphs. I note that there is an algorithm in BGL called 
  1. edmonds_maximum_cardinality_matching 
but this is not what I want. I need to take in count the weights.
I would like to know if this algorithm can be taken in count in the next version of Boost or if you can tell
me some advices to implement it using BGL. The  MaxWeightedMatching algorithm is already implemented in LEMON library: http://www.loco.ic.unicamp.br/~msambinelli/lemon_doc/a00537.html.

Thanks for your time.