If you have enough memory, you could build up a dependency tree. Otherwise, I think you have to make multiple passes.
For each entry:
Do that loop until the list of entries is empty. You can expect to loop over the list once for every generation.
In reply to Re: Perl modules or standard tools for searching hierachical data
by kyle
in thread Perl modules or standard tools for searching hierachical data
by SlackBladder
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |