title: Efficient way to find node set having relationships to given nodes using neo4j
body: <p>Is there an efficient way with given two nodes to find a set of their common nodes (with defined relationships).</p>
  
  <p>For example, having nodes <code>A1</code>, <code>B1</code>, <code>C1</code>-<code>C4</code> connected with relationships <code>x</code> and <code>y</code>:</p>
  
  <pre><code>A1 --x--&gt; C1
  A1 --x--&gt; C2
  A1 --x--&gt; C3
  B1 --y--&gt; C2
  B1 --y--&gt; C3
  B1 --y--&gt; C4
  </code></pre>
  
  <p>a common node set for <code>A1(x)</code> and <code>B1(y)</code> would be <code>[C2, C3]</code>.</p>