A Comparative Analysis of New Approach with an Existing Algorithm to Detect Cycles in a Directed Graph
In various applications such as discovering infinite loops in computer programs, periodic scheduling, communication systems etc. there are always requirement for cycle detection. Graph theories and algorithms are very helpful for this type of problems. In this paper, we proposed our new SUS_CycleDetection algorithm for detecting cycle in any directed graph, with the help of linked list. This algorithm has the ability to count total number of cycles in the graph along with displaying the set of vertices responsible for the formation of each cycle. A comparison is also made between the proposed algorithm and an existing algorithm in terms of their modes of execution. Informer, space is allocated during runtime and nodes are stored using linked list which is more efficient in terms of memory utilization while in the latter, space is allocated before execution and nodes are stored using queue.
KeywordsDirected graph Cycle Linked list Graph theory Data structure
Unable to display preview. Download preview PDF.
- 1.Puczynski, P.: The cycle detection algorithms, Wroclaw University of Technology, Faculty of ManagementGoogle Scholar
- 3.Silberschatz, A., Galvin, P., Gagne, G.: Operating System Concepts, p. 260. John Wiley & Sons, Inc. (2003) ISBN 0-471-25060-0Google Scholar
- 6.Medard, M., Lumetta, S.S.: Network reliability and fault tolerance. In: Proakis, J. (ed.) Wiley Encyclopaedia of EngineeringGoogle Scholar
- 7.Liu, H., Wang, J.: A new way to enumerate cycles in graph., Tsinghua University, State Key Lab of Intelligent Technology and System Department of Computer Science and TechnologyGoogle Scholar