From: Marek Potociar <marek.potociar_at_oracle.com>
Date: Wed, 31 Aug 2011 19:46:33 +0200

As I said, you can iterate over path hierarchies using BFS ( http://en.wikipedia.org/wiki/Breadth-first_search )
algorithm. If that's not practical, you can use DFS + stack (
http://en.wikipedia.org/wiki/Depth-first_search#Algorithm_using_a_stack ). The stack can be explicit or you can leverage
the implicit call stack by implementing recursive iteration.

Btw. I would like to see the real life use case.

Marek

On 08/31/2011 11:16 AM, Sergey Beryozkin wrote:
> However, I'm fine with having it not there, let me know please how does the current API can facilitate something like
> that ?