Hi
as I promised, I added a UNION-FIND implementation to the CLOCC.
You can find it and play with it in the clocc/src/ext/union-find
directory.
The code is released under the (L)GPL.
Spanning trees algorithms will be easier to implement now :)
There isn't much documentation (apart from the doc strings) but I
believe it is already usable along with CLR or the LEDA book (BTW. the
CL implementation is really much cleaner than the C++ one :) ).
Enjoy.
--
Marco Antoniotti =============================================================
NYU Bioinformatics Group tel. +1 - 212 - 998 3488
719 Broadway 12th Floor fax +1 - 212 - 995 4122
New York, NY 10003, USA http://galt.mrl.nyu.edu/valis
Like DNA, such a language [Lisp] does not go out of style.
Paul Graham, ANSI Common Lisp
|
