search

wzhanjun / blog

my person notes
0 stars 0 forks source link

neo4j 数据查询 #15

Open wzhanjun opened 5 years ago

wzhanjun commented 5 years ago

1. 两点之间的关系查询

MATCH (m1:member),(m2:member), 
p = shortestPath((m1)-[:Invite*]-(m2)) 
WHERE (m1.uid) = 100000 AND (m2.uid) = 10133947
return p