Using XSLT to Detect Cycles in a Directed Graph

This paper describes the most difficult stage of a multi-stage process in which a model of a business process is converted from a legacy system to a format digestible by IBM's WebSphere Business Integration Modeler. The stage where cycles must be detected in a directed graph was initially suspected to be beyond the abilities of generic XSLT, which was the tool of choice for the preceding and following stages. The paper describes a well-known algorithm for detecting cycles and then discusses how it can be implemented in XSLT, followed by some observations about the implementation.

By: David Marston

Published in: RC23144 in 2004


This Research Report is available. This report has been submitted for publication outside of IBM and will probably be copyrighted if accepted for publication. It has been issued as a Research Report for early dissemination of its contents. In view of the transfer of copyright to the outside publisher, its distribution outside of IBM prior to publication should be limited to peer communications and specific requests. After outside publication, requests should be filled only by reprints or legally obtained copies of the article (e.g., payment of royalties). I have read and understand this notice and am a member of the scientific community outside or inside of IBM seeking a single copy only.


Questions about this service can be mailed to .