find all possible cycle in graph

I have a E E=[1 2;1 5;2 3;2 4;2 5;3 4;4 5;4 7;4 9;5 6;6 11;6 12;6 13; 7 8;7 9;9 10;9 14;10 11;12 13;13 14] I want to find all possible cycle.

Answer 1

[Nicola Bombace]

Take a look at this answer.

You could use the suggested code to find the cycles.

[Nicola Bombace]

There should be an hyperlink under the word this.

[NA]

I used mentioned link and I have a this result. [1,2,5],[2,3,4],[1,2,4,5],[4,7,9],[1,2,4,5,6,9,10,11],[1,2,4,5,6,9,13,14] the problem is that [1,2,5] is recognized as cycle but on the other hand I have [1,2,4,5]. I want to find minimum number of node in cycle. I want this result [1,2,5],[2,3,4],[2,4,5],[4,7,9],[4,5,6,9,10,11],[4,5,6,9,13,14]