Yanbin99's picture
Initial commit of GITQA
7026c55
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: [0,0]
node 2: [1,0]
node 3: [0,0]
node 4: [1,1]
node 5: [0,1]
node 6: [1,1]
The edges are: (0,2) (0,1) (6,0) (1,5) (4,2) (2,6) (3,6) (5,3) (5,4).