- 语句 1
- 场景:查询 a 和 c 之间经过 b 的最短路径
- 具体语句:
MATCH p = shortestPath((a)-[e*…5]-(b)), p1 = shortestPath((b)-[e1*…5]-(c)) WHERE id(a) == “player101” and id(b) == “player102” and id(c) == “player105” RETURN [p,p1];
- 适合版本:v3.x
- 语句出处:https://discuss.nebula-graph.com.cn/t/topic/14673/