1Department of Master of Computer Applications, AMC Engineering College, Bangalore, India.
2Faculty of Computer Studies, Kadi Sarva Vishwavidyalya, Gandhinagar, India.
This paper presents a novel algorithm to detect cycles in a graph. The graph may be of any type. Cycles are available in a graph and in much real life application; it is required to know the existence of cycles in a graph. This algorithm is developed in the context of network design problem but useful in any graph application where existence is to be finding out. There is no perfect algorithm available in a graph. In this paper an algorithm has been developed to detect cycle.
Cycle, Graph, Network design
