Cool - this looks great. One of the first commercial problems I used
Clojure for required union-find, and I basically solved it using
one-huge-hashmap which I repeatedly assoc'd the equivalences into; I expect
that your library is a lot better.
--
Dave
On Wed, Jan 9, 2013 at 12:10 AM, Jordan
Wow, I was studying clojure by messing around with the Chromatic Polynomial
( deletion-contration of a Graph ) and I think this will be extremely
useful. I'll check it out this weekend.
Thanks!
On Tuesday, January 8, 2013 10:10:40 PM UTC-2, Jordan Lewis wrote:
>
> Hi all,
>
> I couldn't find an
Hi all,
I couldn't find any implementations of union-find[1] for Clojure, so I
wrote one. It's a persistent rendition of the disjoint-set forest
implementation by Tarjan, including the union-by-rank and path compression
optimizations. It acts like a native Clojure collection, as well as
suppor
