title: Matching subtree recursively in Neo4j
body: <p>I'm using Neo4j, and I consider myself quite a newbie, and I don't really understand how I can select a subtree of my graph. I've found solutions using the <code>shortestPath</code> and <code>allShortestPaths</code> but that's not really the same thing as selecting a whole subtree by variable and all its children. </p>
  
  <p>What I want to do is e.g. match <code>MATCH (n {name: "Sovrum"})-[r:CHILDOF]-&gt;(child) return n, child</code> but that only gives me the directly related nodes. <a href="https://i.stack.imgur.com/dwFBq.png" rel="nofollow noreferrer"><img src="https://i.stack.imgur.com/dwFBq.png" alt="enter image description here"></a></p>
  
  <p>Instead I want to select the whole subtree. 
  <a href="https://i.stack.imgur.com/1wb4B.png" rel="nofollow noreferrer"><img src="https://i.stack.imgur.com/1wb4B.png" alt="enter image description here"></a></p>
  
  <p>Is there any good way of doing this or am I missing some vital point in how stuff works?</p>