問題陳述: 添加兩個輸入節點N1和N2與邊緣定向N1 - [:REL] - > N2 1. if n1-[:rel]->n2 exists ignore
2. if n1 and n2 exists but not with [:rel]
create a new relationship edge between the existing nodes
3. if n1 doesnt
我遍歷由cypher.execute()返回該記錄: | p
---+----------------------------
1 | (:A)-[:r]->(:B)-[:r]->(:C)
我使用遍歷它的代碼是這樣的: recordList = graph.cypher.execute(<some query>)
for record in recordList: