问题: 成语骈首就逮和骈首就僇之间2层内的最短关系路径有多少？
Cypher查询:
match p=allshortestpaths((a:ENTITY{name:'骈首就逮'})-[:Relationship*..2]-(b:ENTITY{name:'骈首就僇'})) return count(p)
查询结果:
0