Abstract
Algorithms for traversing and marking the nodes of a directed graph have applications in many fields, for instance search methods in artificial intelligence and garbage collection schemes. In this paper, a general nonrecursive algorithm for the purpose is formulated and proved, and some if its properties are investigated. A second general nonrecursive algorithm is also discussed. Then two implementations of the general algorithms with valuable properties are described. Finally a recursive version is given.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
S. Arnborg,Storage administration in a virtual memory Simula system, BIT 12:2 (1972), 125–141.
C. J. Cheney,A nonrecursive list-compacting algorithm, CACM 13:11 (1970), 677–678.
J. Hopcroft and R. Tarjan,Efficient algorithms for graph manipulation, Stanford, CS Technical Report 207, 1971.
D. E. Knuth,The Art of Computer Programming, Vol. I (Fundamental Algorithms), Addison-Wesley 1968.
N. J. Nilsson,Problem-solving Methods in Artificial Intelligence, McGraw-Hill, New York 1971.
L. E. Thorelli,Description of the programming language LAX, IB-NA Report 72:65, Royal Institute of Technology, Stockholm 1972.
L. E. Thorelli,Description of the LAX/DPL5system, (to appear.)
N. Wirth, and C. A. R. Hoare,A contribution to the development of ALGOL, CACM 9:6 (1966), 413-432.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Thorelli, Le. Marking algorithms. BIT 12, 555–568 (1972). https://doi.org/10.1007/BF01932965
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01932965