Fork me on GitHub
#announcements
<
2020-09-30
>
sylvain07:09:19

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 https://github.com/ageneau/blossom. Feedback / comments welcome !

martinklepsch07:09:08

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

martinklepsch07:09:45

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

sylvain08:09:25

It works for non-bipartite weighted graphs. It's not blossom V (Blossom V refers to https://pub.ist.ac.at/~vnk/papers/blossom5.pdf right ? ). It's based on Galil's paper: http://www.cs.kent.edu/~dragan/GraphAn/p23-galil.pdf

martinklepsch08:09:08

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

sylvain08:09:31

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

blueberry16:09:50

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. http://neanderthal.uncomplicate.org This https://twitter.com/hashtag/opensource?src=hashtag_click work is funded by 2 books! Subscribe at https://aiprobook.com and read 500 pages that are already available now.