CGI/Perl Guide | Learning Center | Forums | Advertise | Login
Site Search: in

  Main Index MAIN
INDEX
Search Posts SEARCH
POSTS
Who's Online WHO'S
ONLINE
Log in LOG
IN

Home: Perl Programming Help: Beginner:
[SOLVED] Finding connected components in a graph.

 



zing
Novice

Oct 2, 2012, 10:42 AM

Post #1 of 2 (1250 views)
[SOLVED] Finding connected components in a graph. Can't Post

I have two arrays having the connection information "from -->to"
@a=a,b,d
@b=c,c,e
The following code finds the connected components based on the content of these two arrays.

Code
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]);
}

my @subgraphs = $g->connected_components;
my $V = $g->vertices;
print "\n$V\n";
print "----connected components------------";
use YAML; print Dump \@subgraphs;

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

Code
----connected components--------------- 
-
- c
- a
- b
-
- e
- d


My question is how do I access only one of the connected components? I.e. either C-A-B or D-E


(This post was edited by zing on Oct 2, 2012, 1:56 PM)


zing
Novice

Oct 2, 2012, 11:41 AM

Post #2 of 2 (1235 views)
Re: [zing] Finding connected components in a graph. [In reply to] Can't Post

Hi all got the solution.

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


 
 


Search for (options) Powered by Gossamer Forum v.1.2.0

Web Applications & Managed Hosting Powered by Gossamer Threads
Visit our Mailing List Archives