|
-
Nov 22nd, 2004, 11:17 AM
#1
My Recursion Hell - By wossname
How do you traverse a many-to-many linked tree searching for a known value?
Each of my objects has a list of other objects it is connected to, the links are 2 way. I am having a problem coming up with an algorithm that will efficiently scan this kind of connected tree without overflowing the stack.
I have done this before about 3 or 4 years ago but I have lost my code and it's driving me mad.
Last edited by wossname; Nov 22nd, 2004 at 11:23 AM.
Posting Permissions
- You may not post new threads
- You may not post replies
- You may not post attachments
- You may not edit your posts
-
Forum Rules
|
Click Here to Expand Forum to Full Width
|