Hi, On Tuesday, March 18, 2014 3:02:01 PM UTC+1, Paul deGrandis wrote:
> I've written general versions of Blossom and Blossom V in the past, and > every so often a similar question comes up on this mailing list. > I'm guessing that wasn't in clojure? :-( Do you happen to know what happens when you throw Blossom V at a graph that doesn't have a perfect matching? E.g. for my use case, hotel room pairing, there's a 1/2 chance the graph ends up having an odd number of nodes... IIUC it won't terminate, but you can detect that it won't, so then you can just give the best-effort solution anyway? > I'd personally love to see both algorithms contributed to Loom if OP is up > for the task. > I'm afraid I've got a convex optimization problem in terms of financial aid grant sizes to solve first before I can start writing that code :-) cheers lvh -- You received this message because you are subscribed to the Google Groups "Clojure" group. To post to this group, send email to clojure@googlegroups.com Note that posts from new members are moderated - please be patient with your first post. To unsubscribe from this group, send email to clojure+unsubscr...@googlegroups.com For more options, visit this group at http://groups.google.com/group/clojure?hl=en --- You received this message because you are subscribed to the Google Groups "Clojure" group. To unsubscribe from this group and stop receiving emails from it, send an email to clojure+unsubscr...@googlegroups.com. For more options, visit https://groups.google.com/d/optout.
