(t *testing.T)
| 87 | } |
| 88 | |
| 89 | func populateGraph(t *testing.T) { |
| 90 | // Add uid edges : predicate neightbour. |
| 91 | neighbour := x.AttrInRootNamespace("neighbour") |
| 92 | edge := &pb.DirectedEdge{ |
| 93 | ValueId: 23, |
| 94 | Attr: neighbour, |
| 95 | } |
| 96 | edge.Entity = 10 |
| 97 | addEdge(t, edge, getOrCreate(x.DataKey(neighbour, 10))) |
| 98 | |
| 99 | edge.Entity = 11 |
| 100 | addEdge(t, edge, getOrCreate(x.DataKey(neighbour, 11))) |
| 101 | |
| 102 | edge.Entity = 12 |
| 103 | addEdge(t, edge, getOrCreate(x.DataKey(neighbour, 12))) |
| 104 | |
| 105 | edge.ValueId = 25 |
| 106 | addEdge(t, edge, getOrCreate(x.DataKey(neighbour, 12))) |
| 107 | |
| 108 | edge.ValueId = 26 |
| 109 | addEdge(t, edge, getOrCreate(x.DataKey(neighbour, 12))) |
| 110 | |
| 111 | edge.Entity = 10 |
| 112 | edge.ValueId = 31 |
| 113 | addEdge(t, edge, getOrCreate(x.DataKey(neighbour, 10))) |
| 114 | |
| 115 | edge.Entity = 12 |
| 116 | addEdge(t, edge, getOrCreate(x.DataKey(neighbour, 12))) |
| 117 | |
| 118 | // add value edges: friend : with name |
| 119 | friend := x.AttrInRootNamespace("friend") |
| 120 | edge.Attr = neighbour |
| 121 | edge.Entity = 12 |
| 122 | edge.Value = []byte("photon") |
| 123 | edge.ValueId = 0 |
| 124 | addEdge(t, edge, getOrCreate(x.DataKey(friend, 12))) |
| 125 | |
| 126 | edge.Entity = 10 |
| 127 | addEdge(t, edge, getOrCreate(x.DataKey(friend, 10))) |
| 128 | } |
| 129 | |
| 130 | func populateClusterGraph(t *testing.T, dg *dgo.Dgraph) { |
| 131 | data1 := [][]int{{10, 23}, {11, 23}, {12, 23}, {12, 25}, {12, 26}, {10, 31}, {12, 31}} |
no test coverage detected