data/cycle/graph_description/easy/graph13.txt

In an undirected graph, (i,j) means that node i and node j are connected with an undirected edge.
The nodes are numbered from 0 to 6, and the edges are: (0,6) (3,2) (6,1) (3,5) (0,3) (4,6).