A time and memory efficient way to enumerate cycles in a graph

Enumerating the cycles in a graph finds numerous applications in communication systems. It is also possible to find given length cycles without enumerating all cycles in the graph. We enumerate the cycles in a directed and undirected graph, in a time and memory efficient manner and make the operations parallelizable, maintaining ease and simplicity to implement.