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
Jeffrey Yasskin wrote:
I have a small class that uses the union/find algorithm to implement a
dynamic equivalence relation. With some work, it could probably also
be used to iterate through the equivalent partition.
Would this be a good thing to add to boost?
Isn't this functionality equivale
I have a small class that uses the union/find algorithm to implement a
dynamic equivalence relation. With some work, it could probably also be
used to iterate through the equivalent partition.
Would this be a good thing to add to boost?
Jeffrey Yasskin
