Beefy Boxes and Bandwidth Generously Provided by pair Networks
"be consistent"
 
PerlMonks  

Depth First Search through Digraph Results in Memory Leak

by djantzen (Priest)
on Jan 08, 2004 at 10:40 UTC ( [id://319780]=perlquestion: print w/replies, xml ) Need Help??

Help for this page

Select Code to Download


  1. or download this
    use strict;
    use warnings;
    ...
    build_graph();
    print "SHOULD BE THE LAST THING PRINTED, HOWEVER ...\n";
    __END__
    
  2. or download this
    BUILDING GRAPH
    Neighbors
    ...
    DESTROYING Node=HASH(0xfc414) 2
    DESTROYING Node=HASH(0x104fbc) 1
    DESTROYING Node=HASH(0xfc450) 3
    

Log In?
Username:
Password:

What's my password?
Create A New User
Domain Nodelet?
Node Status?
node history
Node Type: perlquestion [id://319780]
Approved by broquaint
help
Chatterbox?
and the web crawler heard nothing...

How do I use this?Last hourOther CB clients
Other Users?
Others studying the Monastery: (5)
As of 2024-04-24 23:20 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    No recent polls found