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

Re: Depth First Search through Digraph Results in Memory Leak

by ysth (Canon)
on Jan 08, 2004 at 11:44 UTC ( #319782=note: print w/replies, xml ) Need Help??

Help for this page

Select Code to Download


  1. or download this
        my ($do_search1, $do_search2);
        $do_search2 =  sub {
    ...
            $do_search1->($link->{_to}) unless ($explored->{$link->{_id}})
    +;
          }
        };
    
  2. or download this
    BUILDING GRAPH
    Neighbors
    ...
    DESTROYING Node=HASH(0xa0920e8) 1
    DESTROYING Node=HASH(0xa092124) 2
    SHOULD BE THE LAST THING PRINTED, HOWEVER ...
    

Log In?
Username:
Password:

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

How do I use this? | Other CB clients
Other Users?
Others pondering the Monastery: (4)
As of 2018-05-21 23:13 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?
    Notices?