title: Neo4J path planning and properties
body: <p>I want to find the cheapest path through my graph based on a cost property.
  But I also want to exclude certain relations based on a second properties.</p>
  
  <p>Think of a building with rooms and you can only pass through certain doors if you fit the door.</p>
  
  <p>My relations are defines as:</p>
  
  <pre><code>Door {cost: Number, height: Number}
  </code></pre>
  
  <p>With the rest API I am completely fine using the Dijkstra algorithm to traverse the rooms using the cost property. But I did not find a way how to include the condition on the door height.</p>
  
  <ul>
  <li>Is there a way to include this extra constraint in the Rest API?
  Cypher is more flexible here but does not allow to use Dijkstra currently...</li>
  <li>In a later implementation I want to switch to use A-Star as my planning algorithm. I want to solve this with a plugin. Do I then have to implement my custom <code>PathExpander</code> or is there a way to use the traversal functions? From what I have understood traversal can only be user with depth and breadth first search.</li>
  </ul>