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,1]
node 1: [1,1]
node 2: [1,1]
node 3: [1,1]
node 4: [0,1]
node 5: [0,0]
node 6: [1,1]
The edges are: (6,0) (2,0) (0,5) (0,4) (3,1) (1,5) (6,2) (2,3) (4,2) (3,6) (3,5) (6,5).