Clojurians Log v2
Clojure programming
Channels
Apps
announcements
Project/library announcements ONLY - use threaded replies for discussions. Do not cross post here from other channels. Consider #events or #news-and-articles for other announcements.
sylvain 2020-09-30T07:50:19.063Z
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 !
martinklepsch 2020-09-30T07:51:08.063700Z
Omg, I’ve been close to attempting this a few times, amazing!
martinklepsch 2020-09-30T07:52:45.065Z
Is this Blossom or Blossom V? And remind me, does blossom support matching groups bigger than 2?
sylvain 2020-09-30T08:00:25.065500Z
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
martinklepsch 2020-09-30T08:07:42.066Z
Cool!
martinklepsch 2020-09-30T08:11:08.066900Z
Very curious to hear more about what you’re using this for if you don’t mind sharing ☺️
sylvain 2020-09-30T08:18:31.067200Z
I had plans to make a swiss pairing system for chess tournaments.
2020-09-30T16:57:50.069100Z
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.