print "Number: ", scalar @subgraphs, "\n";
print "First: ", @{ $subgraphs[0] }, "\n";
[download]

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] };
    }
}
[download]

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
[download]

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
[download]

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).

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.
لսႽ† ᥲᥒ⚪⟊Ⴙᘓᖇ Ꮅᘓᖇ⎱ Ⴙᥲ𝇋ƙᘓᖇ

I haven't read YAML before, (Data::Dumper is nice and perl-y), so I'm partly guessing at the structure here.

@subgraphs looks like a list of the connected components. Pick one element of the array, and you're looking at one subgraph.

The number of connected components is just 0+@subgraphs.

Hi there, As per your suggestion I added these two lines, but as you can see in the output section the results are totally invalid.

print "First connected component == $subgraphs[1]\n";
print "Number of connected components== $#subgraphs\n";
[download]

-----OUTPUT----------

5
----connected components---------------
-
  - c
  - b
  - a
-
  - e
  - d
First connected component == ARRAY(0x9a8e308)
Number of connected components== 1
[download]

Yes. The subgraph is an array reference. Dig in! foreach my element (@{ $subgraphs[0] }) {...}

As expected, the last index in your two element array is 1. The other index is 0. As I wrote, you want to print 0+@subgraphs, or more explicitly, scalar(@subgraphs).

Hello zing

I was looking at the same Graph module for several days...
I want to ask the same question for directed graph. I wonder if this module lacks for 'list all path', or whether I miss something.

You can list all shortest path in your graph, if you do like this.

use strict;
use warnings;
use Graph;

my @a=qw(a b d);
my @b=qw(c c e);
my $g = Graph->new( undirected => 1 );
for (my $r = 0; $r <= 2; $r++) {
    $g->add_edge($a[$r], $b[$r]);
}

#get path from apsp
my $apsp=$g->APSP_Floyd_Warshall();

#...with all pattern using glob
my @v=$g->vertices;
my $ptn=join(",", @v);
for (glob "{$ptn},{$ptn}"){ 
    my($u,$v)=split(/,/, $_);
    next if( $u eq $v );    #skip same combination, or ignore self cyc
+le
    my @p=$apsp->path_vertices($u,$v);
    if (@p){
        print join(',', @p), "\n";
    }
}
[download]

I would like to ask for a good way, if you find one.
regards.

Dear remiah, I'll certainly look into that(as I do need what you are doing) and will let you know when i cross over your problem and a solution for the same very soon.