Yanbin99's picture
Initial commit
ecafdc6
In an undirected graph, the nodes are numbered from 0 to 6, 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: [1,1]
node 3: [1,1]
node 4: [1,0]
node 5: [0,0]
node 6: [0,0]
The edges are: (6,0) (0,5) (2,1) (2,4) (6,2) (3,2) (4,3).