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