| 14 | self.populate_graph() |
| 15 | |
| 16 | def populate_graph(self): |
| 17 | # Construct a graph with the form: |
| 18 | # (v1)-[:E]->(v2)-[:E]->(v3)-[:E]->(v4), (v1)-[:E]->(v5)-[:E2]->(v4) |
| 19 | |
| 20 | global nodes |
| 21 | for v in range(1, 6): |
| 22 | node = Node(label="L", properties={"v": v}) |
| 23 | nodes.append(node) |
| 24 | redis_graph.add_node(node) |
| 25 | |
| 26 | edge = Edge(nodes[0], "E", nodes[1]) |
| 27 | redis_graph.add_edge(edge) |
| 28 | |
| 29 | edge = Edge(nodes[1], "E", nodes[2]) |
| 30 | redis_graph.add_edge(edge) |
| 31 | |
| 32 | edge = Edge(nodes[2], "E", nodes[3]) |
| 33 | redis_graph.add_edge(edge) |
| 34 | |
| 35 | edge = Edge(nodes[0], "E", nodes[4]) |
| 36 | redis_graph.add_edge(edge) |
| 37 | |
| 38 | edge = Edge(nodes[4], "E2", nodes[3]) |
| 39 | redis_graph.add_edge(edge) |
| 40 | |
| 41 | redis_graph.commit() |
| 42 | |
| 43 | def test01_invalid_shortest_paths(self): |
| 44 | query = """MATCH (a {v: 1}), (b {v: 4}), p = shortestPath((a)-[*]->(b)) RETURN p""" |