A new way to enumerate cycles in graph

In many cases, the topology of communcation systems can be abstracted and represented as graph. Graph theories and algorithms are useful in these situations. In this paper, we introduced an algorithm to enumerate all cycles in a graph. It can be applied on digraph or undirected graph. Multigraph can also be used on for this purpose. It can be used to enumerate given length cycles without enumerating all cycles. This algorithm is simple and easy to be implemented.