Are there any plans to implement the minimum weight perfect matching algorithm without using BlossomV?

Currently, the minimum weight perfect matching (MWPM) algorithm relies on BlossomV.jl, a wrapper around Kolmogorov's BlossomV software, which has a research-only, non-commercial license. I'm wondering if there are any plans to use an open-source version, such as a pure julia rewrite or a different implementation with a similar performance like the MWPM algorithm in LEMON (http://lemon.cs.elte.hu/pub/doc/latest-svn/index.html), with a much more permissive license? I realize that this issue has been raised in the past (see https://discourse.julialang.org/t/should-we-consider-bindeps-abandoned/23616 and https://github.com/mlewe/BlossomV.jl/pull/15), but I'm a new user and haven't found a follow-up on this issue. So, I figure it doesn't hurt to ask. Thanks a lot in advance!

Start by reviewing how the current BlossomV.jl dependency is used and compare its licensing and performance constraints with the LEMON implementation or a pure Julia rewrite. Read the prior discussions linked in the issue, then define a permissively licensed replacement approach and validate that it preserves the required MWPM behavior and performance.