On Wed, 10 Jul 2002 04:21:56 -0700 (PDT), [EMAIL PROTECTED] (Naomi And
David Swidler) wrote:
>i'm trying to find an algorithm that does the
>following: given a long list of sets, i need to find
>not *where* they intersect, but which intersect with
>which. in the case of a intersects with b and b
i'm trying to find an algorithm that does the
following: given a long list of sets, i need to find
not *where* they intersect, but which intersect with
which. in the case of a intersects with b and b with
c, i need to find the group abc, even though a doesn't
intesect with c. any suggestions? than
