shortestPath后的条件(谓词)会先执行,并不是先求出最短路径后再判断。我们知道最短路径使用双向BFS实现,也就是在每一步遍历的时候都会去判断是否满足条件。
创建一个测试图
CREATE (n1:Person {name:'1'})
CREATE (n2:Person {name:'2'})
CREATE (n3:Person {name:'3'})
CREATE (n4:Person {name:'4'})
CREATE (n5:Person {name:'5'})
CREATE
(n1)-[:A{f:1}]->(n2),
(n2)-[:A{f:2}]->(n3),
(n3)-[:A{f:3}]->(n4),
(n4)-[:B{f:4}]->(n5),
(n5)-[:B{f:5}]->(n1)
![](https://i-blog.csdnimg.cn/blog_migrate/d8c6360d4659632178b883667977dcb2.png)
无条件
match p=shortestPath((m:Person{name:'1'})-[r*1..4]-(n:Person{name:'4'}))
return p;
结果:
![](https://i-blog.csdnimg.cn/blog_migrate/67c2398e320f32dd323d6c2826b370e1.png)
按结点的标签:只经过标签为“A”的结点
match p=shortestPath((m:Person{name:'1'})-[r:A*..4]-(n:Person{name:'4'}))
return p;
结果:
![](https://i-blog.csdnimg.cn/blog_migrate/c8c97808f0bb14757ef2dee6431a6494.png)
按结点的属性:不经过name为'5'的结点
match p=shortestPath((m:Person{name:'1'})-[r*1..4]-(n:Person{name:'4'}))
where all(x in nodes(p) where x.name<>'5')
return p;
结果:
按关系的属性:只经过那些属性f小于4的关系
match p=shortestPath((m:Person{name:'1'})-[r*1..4]-(n:Person{name:'4'}))
where all(x in r where x.f<4)
return p;
结果:
![](https://i-blog.csdnimg.cn/blog_migrate/145c5a7eaa27fb366b0f443d9512281b.png)
如下面的查询会报错,想找出第二个结点为2的最短路径
match p=shortestPath((m:Person{name:'1'})-[]-({name:'2'})-[r*3]-(n:Person{name:'4'}))
return p;
报错:
![](https://i-blog.csdnimg.cn/blog_migrate/ea8516f8a77b2bb3cba6bca57fe7f4be.png)