Finding Cycles

I NEED THIS OUTPUT IN JAVA CODE USING EITHER A LINKED LIST OR ADJACENCY MATRIX

Objective:

With the given graph below use DFS to detect all possible cycles. A cycle is a path (ordered set of vertices) that starts from an arbitrary vertex and ends at the same vertex. You may use either an ardency matrix or the linked form of a graph to achieve this.

Example Print Out:

The Cycles in this graph are

1 5 2 1

1 5 3 1

1 5 7 4 2 1

1 5 7 6 3 1

2 1 5 2

2 1 5 7 4 2

3 1 5 3

3 1 5 7 6 3

4 2 1 5 7 4

5 2 1 5

5 3 1 5

5 7 4 2 1 5

5 7 6 3 1 5

6 3 1 5 7 6

7 4 2 1 5 7

7 6 3 1 5 7

v1 V2 vS vS V4 v6 x7 3 EO-6)