Fork me on GitHub

Hello everyone. I've just made the first release of [ageneau/blossom "0.1.1"]. This library implements Edmonds's blossom algorithm for maximum weight matching in undirected graphs. The code is at Feedback / comments welcome !

🌼 15

Omg, I’ve been close to attempting this a few times, amazing!


Is this Blossom or Blossom V? And remind me, does blossom support matching groups bigger than 2?


It works for non-bipartite weighted graphs. It's not blossom V (Blossom V refers to right ? ). It's based on Galil's paper:


Very curious to hear more about what you’re using this for if you don’t mind sharing ☺️


I had plans to make a swiss pairing system for chess tournaments.


Neanderthal 0.37.0 released! Clojure fast vector, matrix, & linear algebra library. Now automatically detects Apple's OpenCL platform and work around the bugs in the driver. This work is funded by 2 books! Subscribe at and read 500 pages that are already available now.

sheepy 33
bananadance 9
🚀 15