title: How to find the shortest path with the minimum number of hops in Neo4j?
body: <p>Im modeling a graph where nodes are places and edges indicate that you can go from one place to another. </p>
  
  <p>This is to have all routes that you can take from a place to another,
  and you can go from a place to another by different routes, so I want a query that returns me the shortest path with the minimum route changes.</p>
  
  <p>For example, I want to go from A to D, I have two possible paths:</p>
  
  <pre><code>(place {name: "A"})-[:FOLLOWS{route:""R1}]-&gt;(place{name: "B" })-[:FOLLOWS{route:""R4}]-&gt;(place{name:"C"})-[:FOLLOWS{route:""R2}]-&gt;(place{name:"D"})
  
  (place {name: "A"})-[:FOLLOWS{route:""R1}]-&gt;(place{name: "B" })-[:FOLLOWS{route:""R1}]-&gt;(place{name:"F"})-[:FOLLOWS{route:""R2}]-&gt;(place{name:"D"})
  </code></pre>
  
  <p>In the previous two path, both are the same size,  but I would like to get the second one, which is the one who has the minimum route changes.</p>
  
  <p>Thank you.</p>