In an undirected graph, the nodes are numbered from 0 to 4, and every node has an embedding. (i,j) means that node i and node j are connected with an undirected edge.
Embeddings:
node 0: [0,0]
node 1: [0,0]
node 2: [0,1]
node 3: [0,1]
node 4: [0,1]
The edges are: (0,1) (0,3) (4,1) (1,3) (4,2).