问题: 2层之内Alganon和争封的最短路径有多少？
Cypher查询:
match p=allshortestpaths((a:ENTITY{name:'Alganon'})-[:Relationship*..2]-(b:ENTITY{name:'争封'})) return count(p)
查询结果:
0