Beefy Boxes and Bandwidth Generously Provided by pair Networks
Perl: the Markov chain saw
 
PerlMonks  

Re^2: Finding connected components in a graph.

by zing (Beadle)
on Oct 02, 2012 at 18:25 UTC ( #996890=note: print w/ replies, xml ) Need Help??


in reply to Re: Finding connected components in a graph.
in thread Finding connected components in a graph.

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";
-----OUTPUT----------
5 ----connected components--------------- - - c - b - a - - e - d First connected component == ARRAY(0x9a8e308) Number of connected components== 1


Comment on Re^2: Finding connected components in a graph.
Select or Download Code
Re^3: Finding connected components in a graph.
by SuicideJunkie (Priest) on Oct 02, 2012 at 18:32 UTC

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

Log In?
Username:
Password:

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://996890]
help
Chatterbox?
and the web crawler heard nothing...

How do I use this? | Other CB clients
Other Users?
Others surveying the Monastery: (12)
As of 2015-07-02 19:07 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    The top three priorities of my open tasks are (in descending order of likelihood to be worked on) ...









    Results (44 votes), past polls