Abstract

Graph traversal algorithms are important since graphs are a common data structure in which information is distributed. None of the existing algorithmic paradigms focuses on graph traversal. This article introduces enNCE substitution as an extension to eNCE substitution. The relationship between enNCE substitution and eNCE substitution is explored. Moreover, an enNCE previous graph transformation system is defined and then used to generate depth-first and breadth-first previous graph traversal. Thus, enNCE previous graph transformation shows potential as a fundamental concept for a traversal-oriented algorithmic paradigm.