Hi there. I want to recursively concatenate (union) sets that are not disjointed (the intersected set is not empty). For example, if I have the sets

(0)
(0 1)
(0 1 2)
(1 2 3)
(6 4 5)

[download]

The output should be:

((0 1 2 3)
(4 5 6)

[download]
This is the code when I compare iteratively sets one by one: 
use Set::Scalar;

for $i ( 0 .. 4) {$cluster[$i] = Set::Scalar->new;}
    
$cluster[0]->insert(0);
$cluster[1]->insert(0,1);
$cluster[2]->insert(0,1,2);
$cluster[3]->insert(1,2,3);
$cluster[4]->insert(5,6,4);


for $i ( 0 .. 4) {
for $j ( $i+1 .. 4) {
    if ($cluster[$i]->is_properly_intersecting($cluster[$j])) {$cluste
+r[$i]=$cluster[$i]+$cluster[$j];$cluster[$j]->clear;}
}}

[download]
The output is (not what I want): 
(0)
(0 1 2 3)
(0 1 2)
()
(4 5 6)

[download]

In reply to How can sets be recursively concatenated when intersecting with each other by joni

Title:
Use:  <p> text here (a paragraph) </p>
and:  <code> code here </code>
to format your post, it's "PerlMonks-approved HTML":


  • Posts are HTML formatted. Put <p> </p> tags around your paragraphs. Put <code> </code> tags around your code and data!
  • Titles consisting of a single word are discouraged, and in most cases are disallowed outright.
  • Read Where should I post X? if you're not absolutely sure you're posting in the right place.
  • Please read these before you post! —
  • Posts may use any of the Perl Monks Approved HTML tags:
    a, abbr, b, big, blockquote, br, caption, center, col, colgroup, dd, del, details, div, dl, dt, em, font, h1, h2, h3, h4, h5, h6, hr, i, ins, li, ol, p, pre, readmore, small, span, spoiler, strike, strong, sub, summary, sup, table, tbody, td, tfoot, th, thead, tr, tt, u, ul, wbr
  • You may need to use entities for some characters, as follows. (Exception: Within code tags, you can put the characters literally.)
            For:     Use:
    & &amp;
    < &lt;
    > &gt;
    [ &#91;
    ] &#93;
  • Link using PerlMonks shortcuts! What shortcuts can I use for linking?
  • See Writeup Formatting Tips and other pages linked from there for more info.