Beefy Boxes and Bandwidth Generously Provided by pair Networks
more useful options
 
PerlMonks  

Re: Finding connected components in a graph.

by choroba (Chancellor)
on Oct 02, 2012 at 18:20 UTC ( #996889=note: print w/replies, xml ) Need Help??

Help for this page

Select Code to Download


  1. or download this
    print "Number: ", scalar @subgraphs, "\n";
    print "First: ", @{ $subgraphs[0] }, "\n";
    
  2. or download this
    my @subg;
    for my $component (0 .. @subgraphs - 1) {
    ...
                if grep $_ eq $a[$i], @{ $subgraphs[$component] };
        }
    }
    

Log In?
Username:
Password:

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://996889]
help
Chatterbox?
[Discipulus]: The Count of Moret; The Red Sphinx is a single book appeared with different titles. it is one of the best and alot of understimed Dumas book.
choroba has only read the first two
[Discipulus]: if i can suggest La Reine Margot too is a great book and obviously The Count of Monte Cristo that is a chef-d'œuvre
[Discipulus]: The red sphinx is about Rechilieu, absolutely thrilling
[erix]: thanks, Discipulus - I got them lined up at gutenberg :)

How do I use this? | Other CB clients
Other Users?
Others chilling in the Monastery: (9)
As of 2017-05-24 07:21 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?