Re: How can sets be recursively concatenated when intersecting with each other


No such thing as a small change
	PerlMonks

Re: How can sets be recursively concatenated when intersecting with each other

by jdporter (Paladin)

on Apr 25, 2011 at 06:44 UTC ( [id://901155]=note: print w/replies, xml )

Need Help??

in reply to How can sets be recursively concatenated when intersecting with each other

use Graphs.

use Graph;
use strict;
use warnings;

my @sets = (
    [qw(0)],
    [qw(0 1)],
    [qw(0 1 2)],
    [qw(1 2 3)],
    [qw(4 5 6)],
);

my $gr = new Graph undirected => 1, unionfind => 1;

for my $set ( @sets )
{
    @$set == 1 and $gr->add_vertex( $set->[0] );
    @$set <= 1 and next;
    $gr->add_edge( $set->[$_-1], $set->[$_] )  for 1 .. $#{$set};
}


for my $set ( $gr->connected_components )
{
    print "( @$set )\n";
}
[download]

I reckon we are the only monastery ever to have a dungeon stuffed with 16,000 zombies.