()
| 43 | |
| 44 | |
| 45 | def binary_tree_graph1(): |
| 46 | global redis_graph |
| 47 | |
| 48 | redis_con = _brand_new_redis() |
| 49 | redis_graph = Graph(redis_con, "G1") |
| 50 | redis_graph.query("CREATE(a: A {name: 'a'}), \ |
| 51 | (b1: X {name: 'b1'}), \ |
| 52 | (b2: X {name: 'b2'}), \ |
| 53 | (b3: X {name: 'b3'}), \ |
| 54 | (b4: X {name: 'b4'}), \ |
| 55 | (c11: X {name: 'c11'}), \ |
| 56 | (c12: X {name: 'c12'}), \ |
| 57 | (c21: X {name: 'c21'}), \ |
| 58 | (c22: X {name: 'c22'}), \ |
| 59 | (c31: X {name: 'c31'}), \ |
| 60 | (c32: X {name: 'c32'}), \ |
| 61 | (c41: X {name: 'c41'}), \ |
| 62 | (c42: X {name: 'c42'}) \ |
| 63 | CREATE(a)-[:KNOWS] -> (b1), \ |
| 64 | (a)-[:KNOWS] -> (b2), \ |
| 65 | (a)-[:FOLLOWS] -> (b3), \ |
| 66 | (a)-[:FOLLOWS] -> (b4) \ |
| 67 | CREATE(b1)-[:FRIEND] -> (c11),\ |
| 68 | (b1)-[:FRIEND] -> (c12), \ |
| 69 | (b2)-[:FRIEND] -> (c21), \ |
| 70 | (b2)-[:FRIEND] -> (c22), \ |
| 71 | (b3)-[:FRIEND] -> (c31), \ |
| 72 | (b3)-[:FRIEND] -> (c32), \ |
| 73 | (b4)-[:FRIEND] -> (c41), \ |
| 74 | (b4)-[:FRIEND] -> (c42) \ |
| 75 | CREATE(b1)-[:FRIEND] -> (b2), \ |
| 76 | (b2)-[:FRIEND] -> (b3), \ |
| 77 | (b3)-[:FRIEND] -> (b4), \ |
| 78 | (b4)-[:FRIEND] -> (b1) \ |
| 79 | ") |
| 80 | |
| 81 | |
| 82 | def binary_tree_graph2(): |
nothing calls this directly
no test coverage detected