Yanbin99's picture
Initial commit
ecafdc6
In an undirected graph, the nodes are numbered from 0 to 8, and every node has an embedding. (i,j) means that node i and node j are connected with an undirected edge.
Embeddings:
node 0: [1,1]
node 1: [0,1]
node 2: [1,0]
node 3: [0,0]
node 4: [0,0]
node 5: [1,0]
node 6: [0,0]
node 7: [0,1]
node 8: [1,1]
The edges are: (3,0) (1,0) (4,0) (1,7) (2,6) (8,3) (5,4) (4,6).