Cycle that does not use the same edge twice.
Example
In the undirected graph below, the cycle constituted in order by the edges a, b, c, d, h and n is a simple cycle that starts and ends at vertex A.
In the undirected graph below, the cycle constituted in order by the edges a, b, c, d, h and n is a simple cycle that starts and ends at vertex A.