This is the mail archive of the
xsl-list@mulberrytech.com
mailing list .
Depth first search of cyclic graph?
- To: "'xsl-list at lists dot mulberrytech dot com'" <xsl-list at lists dot mulberrytech dot com>
- Subject: [xsl] Depth first search of cyclic graph?
- From: "WATKIN-JONES,ADAM (HP-UnitedKingdom,ex1)" <adam_watkin-jones at hp dot com>
- Date: Thu, 25 Oct 2001 12:29:05 +0100
- Reply-To: xsl-list at lists dot mulberrytech dot com
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