Edit: The bounty is removed as the urgency to fix this is gone now that we have working MWPM on all platforms thanks to LEMONGraphs.jl. Leaving this up as a feature request.
Implement the well-known Blossom algorithm for maximum weight (perfect) matching in generic graphs.
Two bounties are available here:
a 500$ bounty for implementing a pure-julia Blossom with tests and documentation, making it the default here, and moving BlossomV.jl from a dependency to a weak dependency (so that it is not necessary during installation)
a 500$ bounty on improving the performance of the new implementation to no-worse than 90% of BlossomV.jl
Edit: The bounty is removed as the urgency to fix this is gone now that we have working MWPM on all platforms thanks to LEMONGraphs.jl. Leaving this up as a feature request.
Implement the well-known Blossom algorithm for maximum weight (perfect) matching in generic graphs.
Two bounties are available here:
a 500$ bountyfor implementing a pure-julia Blossom with tests and documentation, making it the default here, and movingBlossomV.jlfrom a dependency to a weak dependency (so that it is not necessary during installation)a 500$ bountyon improving the performance of the new implementation to no-worse than 90% ofBlossomV.jl