That pseudo code is entirely broken.
It processes the root node; then its children; then their children; then ....
And if you corrected all of that, it would run 10x slower than a single threaded solution.
In reply to Re^2: Depth First Search
by BrowserUk
in thread Depth First Search
by gbar
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |