On Fri, 17 Jan 2003 12:28:50 +0100, Miroslav Silovic wrote: > 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 equivalent to the dynamic connected components > in the Boost graph library? > > Miro
Oops. Yes. Never mind. Jeffrey _______________________________________________ Unsubscribe & other changes: http://lists.boost.org/mailman/listinfo.cgi/boost
