That pseudo code is entirely broken.
- It doesn't do a depth first search.
It processes the root node; then its children; then their children; then ....
- It provides no possibility for "all children at the same stage will be analyse together"
- It makes no attempt to do any locking of the shared data structure.
And if you corrected all of that, it would run 10x slower than a single threaded solution.
With the rise and rise of 'Social' network sites: 'Computers are making people easier to use everyday'
Examine what is said, not who speaks -- Silence betokens consent -- Love the truth but pardon error.
In the absence of evidence, opinion is indistinguishable from prejudice.