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