Neo4J查询不显示路径

我在城市中创建运输测试数据库。我的目标是在任何站点之间找到路径。我创造了这个图表：Neo4J查询不显示路径

create (Stop_13_1:Tram {Id: 131}), 
(Stop_13_2:Tram {Id: 132}), 
(Stop_26_1:Tram {Id: 261}), 
(Stop_26_2:Tram {Id: 262}), 
(Stop_26_3_13_3:Tram {Id: 263133}), 
(Stop_26_4_13_4:Tram {Id: 264134}), 
(Stop_26_5_13_5:Tram {Id: 265135}), 
(Stop_26_6_13_6:Tram {Id: 266136}), 
(Stop_26_7_13_7:Tram {Id: 267137}), 
(Stop_26_8:Tram {Id: 268}), 
(Stop_7_1:Trollebus {Id: 71}), 
(Stop_7_2:Trollebus {Id: 72}), 
(Stop_7_3:Trollebus {Id: 73}), 
(Stop_7_4:Trollebus {Id: 74}), 
(Stop_7_5:Trollebus {Id: 75});

当我试图找到一小段路：

match p=shortestPath((a)-[:TO*]-(c)) 
where a.Id=131 and c.Id=268 
return p, length(p) limit 1

或者这个查询：

MATCH (p1:Tram {id: 131}), (p2:Tram {id: 263133}), 
     path = shortestpath((p1)-[:NEXT*]-(p2)) 
RETURN path

它没有表现出任何的路线。你能帮我编辑查询吗？

P.S.我忘了补充关系：

MATCH (Stop_13_1 {Id: 131}), 
    (Stop_13_2 {Id: 132}), 
    (Stop_26_1 {Id: 261}), 
    (Stop_26_2 {Id: 262}), 
    (Stop_26_3_13_3 {Id: 263133}), 
    (Stop_26_4_13_4 {Id: 264134}), 
    (Stop_26_5_13_5 {Id: 265135}), 
    (Stop_26_6_13_6 {Id: 266136}), 
    (Stop_26_7_13_7 {Id: 267137}), 
    (Stop_26_8 {Id: 268}), 
    (Stop_7_1 {Id: 71}), 
    (Stop_7_2 {Id: 72}), 
    (Stop_7_3 {Id: 73}), 
    (Stop_7_4 {Id: 74}), 
    (Stop_7_5 {Id: 75}) 
    MERGE   (Stop_13_1)- [:NEXT{distance:4.7,route:13,transport:'tram',direct:'down'}]->(Stop_13_2) 
    MERGE   (Stop_13_2)-[:NEXT{distance:4.7,route:13,transport:'tram',direct:'up'}]->(Stop_13_1) 
    MERGE   (Stop_13_2)-[:NEXT{distance:3.7,route:13,transport:'tram',direct:'down'}]->(Stop_26_3_13_3) 
    MERGE   (Stop_26_3_13_3)-[:NEXT{distance:3.7,route:13,transport:'tram',direct:'up'}]->(Stop_13_2) 
    MERGE   (Stop_26_1)-[:NEXT{distance:5.8,route:26,transport:'tram',direct:'down'}]->(Stop_26_2) 
    MERGE   (Stop_26_2)-[:NEXT{distance:5.8,route:26,transport:'tram',direct:'up'}]->(Stop_26_1) 
    MERGE   (Stop_26_2)-[:NEXT{distance:2.5,route:26,transport:'tram',direct:'down'}]->(Stop_26_3_13_3) 
    MERGE   (Stop_26_3_13_3)-[:NEXT{distance:2.5,route:26,transport:'tram',direct:'up'}]->(Stop_26_2) 
    MERGE   (Stop_26_3_13_3)-[:NEXT{distance:3.1,route:26,route:13,transport:'tram',direct:'down'}]->(Stop_26_4_13_4) 
    MERGE   (Stop_26_4_13_4)-[:NEXT{distance:3.1,route:26,route:13,transport:'tram',direct:'up'}]->(Stop_26_3_13_3) 
    MERGE   (Stop_26_4_13_4)-[:NEXT{distance:5.8,route:26,route:13,transport:'tram',direct:'down'}]->(Stop_26_5_13_5) 
    MERGE   (Stop_26_5_13_5)-[:NEXT{distance:5.8,route:26,route:13,transport:'tram',direct:'up'}]->(Stop_26_4_13_4) 
    MERGE   (Stop_26_5_13_5)-[:NEXT{distance:10.8,route:26,route:13,transport:'tram',direct:'down'}]->(Stop_26_6_13_6) 
    MERGE   (Stop_26_6_13_6)-[:NEXT{distance:10.8,route:26,route:13,transport:'tram',direct:'up'}]->(Stop_26_5_13_5) 
    MERGE   (Stop_26_6_13_6)-[:NEXT{distance:2.5,route:26,route:13,transport:'tram',direct:'down'}]->(Stop_26_7_13_7) 
    MERGE   (Stop_26_7_13_7)-[:NEXT{distance:2.5,route:26,route:13,transport:'tram',direct:'up'}]->(Stop_26_6_13_6) 
    MERGE   (Stop_26_5_13_5)-[:NEXT{distance:0.6,transport:'walking',direct:'down'}]->(Stop_7_2) 
    MERGE   (Stop_7_2)-[:NEXT{distance:0.6,transport:'walking',direct:'up'}]->(Stop_26_5_13_5) 
    MERGE   (Stop_26_8)-[:NEXT{distance:1,route:26,transport:'tram',direct:'down'}]->(Stop_26_7_13_7) 
    MERGE   (Stop_26_7_13_7)-[:NEXT{distance:1,route:26,transport:'tram',direct:'up'}]->(Stop_26_8) 
    MERGE   (Stop_7_1)-[:NEXT{distance:2.2,route:7,transport:'trolleybus',direct:'down'}]->(Stop_7_2) 
    MERGE   (Stop_7_2)-[:NEXT{distance:2.2,route:7,transport:'trolleybus',direct:'up'}]->(Stop_7_1) 
    MERGE   (Stop_7_2)-[:NEXT{distance:1.6,route:7,transport:'trolleybus',direct:'up'}]->(Stop_7_3) 
    MERGE   (Stop_7_3)-[:NEXT{distance:2.5,route:7,transport:'trolleybus',direct:'up'}]->(Stop_7_4) 
    MERGE   (Stop_7_4)-[:NEXT{distance:3.1,route:7,transport:'trolleybus',direct:'down'}]->(Stop_7_5) 
    MERGE   (Stop_7_5)-[:NEXT{distance:4.4,route:7,transport:'trolleybus',direct:'down'}]->(Stop_7_2)

来源

2016-07-24 user3231442

您已经向我们展示了您的创建r节点，但我没有看到任何关系的创建。你可以添加到你的描述？另外，你是否可以拆分创建，让每个创建的元素都在自己的行上？不得不水平滚动浏览它使其很难阅读。 – InverseFalcon

Christophe的答案是正确的，但对于下一步，我建议添加APOC程序插件，这将允许您使用加权最短路径，该路径将考虑您的：NEXT关系中的距离属性。 https://github.com/neo4j-contrib/neo4j-apoc-procedures#graph-algorithms-work-in-progress – InverseFalcon

您正在试图匹配有TO关系的最短路径，但是你的图表显示，这种关系的类型是NEXT。

我复制在这里你的图http://console.neo4j.org/r/boin78

而下面的查询工作正常通过只指定正确的关系类型：

match p=shortestPath((a)-[:NEXT*]-(c)) 
where a.Id=131 and c.Id=268 
return p, length(p) 
limit 1

对于第二个查询，您使用的id作为同时财产您节点具有Id属性名称，以下工作：

MATCH (p1:Tram {Id: 131}), (p2:Tram {Id: 263133}), 
path = shortestpath((p1)-[:NEXT*]-(p2)) 
RETURN path

来源

2016-07-24 17:44:30

Neo4J查询不显示路径

回答

相关问题