data/cycle/graph_description/easy/graph1.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 4, and the edges are: (3,4) (0,2) (1,4) (0,3).