我復(fù)制了你更新的csv(并刪除了第一列頭部的空白)并運(yùn)行了你的查詢 .

neo4j-sh (?)$ USING PERIODIC COMMIT LOAD CSV WITH HEADERS FROM "file:///Users/jonatan/src/doc/stackexchange/32225817.pdc" as row CREATE (:Activity {startActivityId:row.startActivityId, name:row.Name, endActivityId:row.endActivityId});

+-------------------+

| No data returned. |

+-------------------+

Nodes created: 4

Properties set: 12

Labels added: 4

115 ms

neo4j-sh (?)$ USING PERIODIC COMMIT LOAD CSV WITH HEADERS FROM "file:///Users/jonatan/src/doc/stackexchange/32225817.pdc" as row MATCH (s:Activity {startActivityId:row.startActivityId}) MATCH (e:Activity {startActivityId:row.endActivityId}) MERGE (s)-[r:LINKS_TO]->(e) RETURN r;

+-------------------+

| r |

+-------------------+

| :LINKS_TO[2084]{} |

| :LINKS_TO[2085]{} |

| :LINKS_TO[2086]{} |

+-------------------+

3 rows

Relationships created: 3

178 ms

創(chuàng)造了三種關(guān)系 . 要確認(rèn)它們是我匹配的正確關(guān)系并返回路徑 (:Activity)-[:LINKS_TO]->() .

neo4j-sh (?)$ MATCH p=(:Activity)-[:LINKS_TO]->() RETURN p;

+-------------------------------------------------------------------------------------------------------------------------------------------+

| p |

+-------------------------------------------------------------------------------------------------------------------------------------------+

| [Node[1415]{name:"A",startActivityId:"1",endActivityId:"2"},:LINKS_TO[2084]{},Node[1416]{name:"B",startActivityId:"2",endActivityId:"3"}] |

| [Node[1416]{name:"B",startActivityId:"2",endActivityId:"3"},:LINKS_TO[2085]{},Node[1417]{name:"C",startActivityId:"3",endActivityId:"4"}] |

| [Node[1417]{name:"C",startActivityId:"3",endActivityId:"4"},:LINKS_TO[2086]{},Node[1418]{name:"D",startActivityId:"4",endActivityId:"5"}] |

+-------------------------------------------------------------------------------------------------------------------------------------------+

3 rows

49 ms

neo4j-sh (?)$

它看起來(lái)不錯(cuò)，不確定哪些不適合你 .

MATCH p=(:Activity)-[r]->() RETURN p; 告訴你什么？

總結(jié)

以上是生活随笔為你收集整理的neo4j java label_Neo4j：在具有相同Label的两个或多个节点之间创建关系的全部?jī)?nèi)容，希望文章能夠幫你解決所遇到的問(wèn)題。

如果覺(jué)得生活随笔網(wǎng)站內(nèi)容還不錯(cuò)，歡迎將生活随笔推薦給好友。