Re: [boost] Equivalence Relation class

From: Jeremy Siek (jsiek_at_[hidden])
Date: 2003-01-19 15:31:59

Hi Jeffrey,

I think so.

union/find is used in the Boost Graph Library, and there is an
implementation of it, in boost/pending/disjoint_sets.hpp. The reason it is
in pending is that I've never bothered to write docs and submit it to
boost. Anyways, it would be interesting to compare the interface and
implementation to what you've got. And if you're interested in championing
the addition of union/find to boost I'd be behind you.

Cheers,
Jeremy

On Thu, 16 Jan 2003, Jeffrey Yasskin wrote:
jyassk> I have a small class that uses the union/find algorithm to
jyassk> implement a dynamic equivalence relation. With some work, it could
jyassk> probably also be used to iterate through the equivalent partition.
jyassk>
jyassk> Would this be a good thing to add to boost?
jyassk>
jyassk> Jeffrey Yasskin
jyassk>
jyassk>
jyassk> _______________________________________________
jyassk> Unsubscribe & other changes: http://lists.boost.org/mailman/listinfo.cgi/boost
jyassk>

----------------------------------------------------------------------
 Jeremy Siek                          http://php.indiana.edu/~jsiek/
 Ph.D. Student, Indiana Univ. B'ton   email: jsiek_at_[hidden]
 C++ Booster (http://www.boost.org)   office phone: [phone]
----------------------------------------------------------------------