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