File size: 2,130 Bytes
ae7c0d4 062ac3f ae7c0d4 062ac3f ae7c0d4 |
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 |
# Copyright Jiaqi Liu
#
# Licensed under the Apache License, Version 2.0 (the "License");
# you may not use this file except in compliance with the License.
# You may obtain a copy of the License at
#
# http://www.apache.org/licenses/LICENSE-2.0
#
# Unless required by applicable law or agreed to in writing, software
# distributed under the License is distributed on an "AS IS" BASIS,
# WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
# See the License for the specific language governing permissions and
# limitations under the License.
from behave import *
from neo4j import GraphDatabase
@when("we expand 'δέ' by 3 hops at most")
def step_impl(context):
assert True is not False
@then('we get 13 nodes and 13 links, all distinct')
def step_impl(context):
driver = GraphDatabase.driver("neo4j://localhost:7687", auth=("not used", "not used"))
with driver.session() as session:
result = parse_apoc_path_expand_result(session.run(
"""
MATCH (node{label:"δέ"})
CALL apoc.path.expand(node, "LINK", null, 1, 3)
YIELD path
RETURN path;
"""
))
print(set(result["nodes"]))
assert set(result["nodes"]) == {"aber lieber", "aber", "but", "sed", "ἀλλά", "δέ", "and", "τε", "et", "καί",
"also", "even", "δ᾽"}
def parse_apoc_path_expand_result(result):
nodes = set()
links = []
nodeMap = dict()
duplicateLinks = set()
for record in result:
path = record["path"]
for node in path.nodes:
label = dict(node)["label"]
nodes.add(label)
nodeMap[node.id] = label
for link in path.relationships:
if link.id not in duplicateLinks:
duplicateLinks.add(link.id)
links.append({
"source": nodeMap[link.start_node.id],
"target": nodeMap[link.end_node.id],
"label": dict(link)["label"],
})
return {"nodes": list(nodes), "links": links}
|