Print the edges (points) of undirected graph

Question

How I can print the points : I mean "(x,y)" of a cycle in a graph ? . I am stuck there. I don't know how to print the points that are on the cycle.

Answer 1

Imagine the algorithm you are running as movements along the graph. In order to detect a cycle, you check every possible movement from a starting position whether it brings you back to the starting position. This you do recursively for any adjacent vertex. Now, when you detect a cycle, your path resembles the recursive calls that you made.

A few notes:

• Since this is clearly homework, I'm not giving you a full solution but enough of a hint.
• If you have trouble imagining this as movement, print the current position at different points during program execution.
• I don't think your algorithm is implemented correctly. Make sure that you have a few test cases to verify that it does what it should.