问题: 莺科与鸫科2层内的最短关系路径有多少？
Cypher查询:
match p=allshortestpaths((a:ENTITY{name:'莺科'})-[:Relationship*..2]-(b:ENTITY{name:'鸫科'})) return count(p)
查询结果:
3