Why are you making more than one sweep across your cluster? In your first sweep, you will have collected all intersecting sets into one set already.
You don't show how you output your data, so I can't comment on why your output is not what you want. But note that at least you found the two disjoint sets, (0 1 2 3) and (4 5 6).
In reply to Re: How can sets be recursively concatenated when intersecting with each other
by Corion
in thread How can sets be recursively concatenated when intersecting with each other
by joni
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |