Depth first search of cyclic graph?

I've been wondering for some time how a depth first search of a cyclic graph
would work in XSLT.

I imagined it could be done by carrying a list of visited nodes plus a
current path (perhaps space separated list of integer node keys?) forward
through recursion .  Then, when one path terminates, it would be possible to
walk back up the path to determine where to carry on the recursion.
However, the depth of recursion would be rather great.

Anyhow, has anyone worked it out?

Thanks,
Adam



 XSL-List info and archive:  http://www.mulberrytech.com/xsl/xsl-list