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? thanks. naomi
__________________________________________________ Do You Yahoo!? Sign up for SBC Yahoo! Dial - First Month Free http://sbc.yahoo.com -- To unsubscribe, e-mail: [EMAIL PROTECTED] For additional commands, e-mail: [EMAIL PROTECTED]
