Efficient way to find node set having relationships to given nodes using neo4j

Posted by Jonas on Stack Overflow See other posts from Stack Overflow or by Jonas
Published on 2010-06-02T08:21:29Z Indexed on 2010/06/02 8:23 UTC
Read the original article Hit count: 286

Filed under:
|
|
|

Is there an efficient way with given two nodes to find a set of their common nodes (with defined relationships).

For example, having nodes A1, B1, C1-C4 connected with relationships x and y:

A1 --x--> C1
A1 --x--> C2
A1 --x--> C3
B1 --y--> C2
B1 --y--> C3
B1 --y--> C4

a common node set for A1(x) and B1(y) would be [C2, C3].

© Stack Overflow or respective owner

Related posts about java

Related posts about graph