Algorithms to Identify All the Cycle Bases in a UnDirected Graph

Question

I have an undirected graph with Vertex V and Edge E. I am looking for an algorithm to identify all the cycle bases in that graph.

I think

Answer 1

The standard way to detect a cycle is to use two iterators - for each iteration, one moves forward one step and the other two. Should there be a cycle, they will at some point point to each other.

This approach could be extended to record the cycles so found and move on.