Hi! I'm trying to find a maximum weighted graph matching for a given graph. Searching for this has proven difficult; search engines like to give me results that involve a lot of pattern matching and not a lot of graph matching.
I know algorithms for this exist; specifically variants of Edmonds' Blossom algorithm (which finds maximal matchings on arbitrary graphs, but says nothing about weights). I've found Loom, a Clojure graph library, which doesn't appear to implement this algorithm. I've found JGraphT, which only implements the unweighted version. thanks! 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.
