Beefy Boxes and Bandwidth Generously Provided by pair Networks
Clear questions and runnable code
get the best and fastest answer
 
PerlMonks  

Re: Finding connected components in a graph.

by choroba (Canon)
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?
and the web crawler heard nothing...

How do I use this? | Other CB clients
Other Users?
Others imbibing at the Monastery: (3)
As of 2015-04-02 02:09 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    Who makes your decisions?







    Results (55 votes), past polls