Beefy Boxes and Bandwidth Generously Provided by pair Networks
Think about Loose Coupling
 
PerlMonks  

Re3: Depth First Search through Digraph Results in Memory Leak

by Hofmator (Curate)
on Jan 09, 2004 at 13:44 UTC ( #320109=note: print w/replies, xml ) Need Help??

Help for this page

Select Code to Download


  1. or download this
    # this marks the current vertex
    $explored->{$node->{_id}}++;
    
    ...
       # not of the vertex!!
       $do_search->($link->{_to}) unless ($explored->{$link->{_id}});
    }
    
  2. or download this
    $explored->{$node->{_id}}++;
    foreach my $link (@{$node->{_outlinks}}) {
       my $new_node = $link->{_to};
       $do_search->($new_node) unless ($explored->{$new_node->{_id}});
    }
    

Log In?
Username:
Password:

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://320109]
help
Chatterbox?
and all is quiet...

How do I use this? | Other CB clients
Other Users?
Others surveying the Monastery: (3)
As of 2017-12-16 01:54 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?
    What programming language do you hate the most?




















    Results (447 votes). Check out past polls.

    Notices?