|
|
Boost : |
From: Miroslav Silovic (miro_at_[hidden])
Date: 2003-01-17 06:28:50
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
Boost list run by bdawes at acm.org, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk