title: Cypher for all paths between two nodes
body: <p>I have a graph with millions of nodes and relations. I need to get all paths between two nodes. In my case all of nodes in relation paths must be <strong>same label</strong></p>
  
  <p>my query like this;</p>
  
  <pre><code>match (n:Label) match (m:Label) where n.NAME='foo' and m.NAME='foo2'
  match p=(n)-[r*..20]-(m) where all(x in nodes(p) where (x:Label))
  with p
  return p, EXTRACT(x IN nodes(p) | x.NAME), EXTRACT(r IN relationships(p) | type(r))
  </code></pre>
  
  <p>Node count with label "Label" is about 20 but this query traverse in all graph to find all possible paths between two nodes and then trying reduce paths with my "where all" clause. It crashes my db then.</p>
  
  <p>I need to get all nodes with label name "Label" and their relations, then query paths between subgraph to reduce cost.</p>