Think about Loose Coupling | |
PerlMonks |
Re: Re: Depth First Search through Digraph Results in Memory Leakby djantzen (Priest) |
on Jan 09, 2004 at 13:32 UTC ( [id://320105]=note: print w/replies, xml ) | Need Help?? |
I think that's okay. I'm using the algorithm from Goodrich & Tamassia's Data Structures and Algorithms in Java pg. 377. In pseudocode:
DirectedDFS(v): Which makes sense to me since the objective is to locate all reachable vertices. Imagine the case where you had more than one edge connecting two vertices. You'd end up counting all the paths to a node but that isn't the goal, well at least not a transitive closure anyway.
"The dead do not recognize context" -- Kai, Lexx
In Section
Seekers of Perl Wisdom
|
|