Beefy Boxes and Bandwidth Generously Provided by pair Networks
go ahead... be a heretic
 
PerlMonks  

Re^3: Finding connected components in a graph.

by SuicideJunkie (Vicar)
on Oct 02, 2012 at 18:32 UTC ( #996892=note: print w/replies, xml ) Need Help??


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

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://996892]
help
Chatterbox?
and all is quiet...

How do I use this? | Other CB clients
Other Users?
Others chanting in the Monastery: (5)
As of 2018-06-24 03:41 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?
    Should cpanminus be part of the standard Perl release?



    Results (126 votes). Check out past polls.

    Notices?