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