[jgrapht-users] Edmund blossom shrinking algorithm on weighted graph?

[Andrew W. <and...@gm...>]

Hello

I've been looking at the implementation of Edmund's blossom algorithm at
https://github.com/jgrapht/jgrapht/blob/master/jgrapht-core/src/main/java/org/jgrapht/alg/EdmondsBlossomShrinking.java
but it doesn't seem to be taking weighted edges into account, meaning it
doesn't find the matches of minimum/maximum total weight. Will there be an
implementation of what I described coming?