in reply to Finding connected components in a graph.
print "Number: ", scalar @subgraphs, "\n";
print "First: ", @{ $subgraphs[0] }, "\n";
Update: If you also want to generate the subgraphs corresponding to the components, you can use the following code:
my @subg;
for my $component (0 .. @subgraphs  1) {
$subg[$component] = Graph::Undirected>new;
for my $i (0 .. $#a) {
$subg[$component]>add_edge($a[$i], $b[$i])
if grep $_ eq $a[$i], @{ $subgraphs[$component] };
}
}
Re^2: Finding connected components in a graph. by zing (Beadle) on Oct 03, 2012 at 15:50 UTC 
Hi guys, I have this code which takes in input in the form of triplets of vertices(see DATA)
use strict;
use warnings;
use Data::Dumper;
my @S;
while (<DATA>) {
push @S, [split];
}
print "TRIPLETS\n";
print Dumper \@S;
__DATA__
b c a
a c d
d e b
What Im stuck with is this :: Suppose I have these points=(a,b,c,d);
Then I want to find the set of triplets induced by these 4 vertices.
For example for above four points the induced triplets should be:
b c a
a c d
Whereas for vertices=(d,e,a) there isn't any triplet in the data.
Similarly for vertices=(b,e,d) there is a triplet (d e b) in the data(the last one).  [reply] [d/l] [select] 

This is barely related to the post you replied to. Please, if you have a new question, start a new thread. It can bring you more attention.
 [reply] 

Thanks for the suggestion choroba.
 [reply] 
