期刊名称：BVICAM's International Journal of Information Technology
印刷版ISSN：0973-5658
出版年度：2014
卷号：6
期号：2
语种：English
出版社：Bharati Vidyapeeth's Institute of Computer Applications and Management
摘要：In computer science, cycle detection is the algorithmic problem of finding a cycle in a sequence of iterated functionvalues. The analysis of cycles in network has different application in the design and development in communication systems such as the investigation of topological features and consideration of reliability and fault tolerance. There are various problems related to the analysis of cycles in network among which the most important one is the detection of cycles in graph. In this paper, we proposed SUS_dcycle method which is a detection algorithm for detecting cycle in a directed graph, with the help of linked list in order to discover new lists in run time. This algorithm is used to detect the cycle in any type of directed graph. The proposed algorithm differs from other existing algorithms through its ability to count the total number of cycles present in any type of directed graphs. Also the study of earlier works says that this is a novel approach for the prescribed task and complex problems may use it as a subroutine application for effective results. In advanced computing, time-space trade-off is an important factor to efficiently deal with the problems. This method may solve the above said purpose.
关键词：Index Terms – Directed graph;Cycle;Linked list;Graph theory;and Data structure.
