title: Get all Routes between two nodes neo4j
body: <p>I'm working on a project where I have to deal with graphs...
  I'm using a graph to get routes by bus and bike between two stops.</p>
  
  <p>The fact is,all my relationship contains the time needed to go from the start point of the relationship and the end. </p>
  
  <p>In order to get the shortest path between to node, I'm using the shortest path function of cypher. But something, the shortest path is not the fastest....</p>
  
  <p>Is there a way to get all paths between two nodes not linked by a relationship? </p>
  
  <p>Thanks</p>
  
  <p>EDIT:</p>
  
  <p>In fact I change my graph, to make it easier.
  So I still have all my nodes. Now the relationship type correspond to the time needed to go from a node to another. </p>
  
  <p>The shortestPath function of cypher give the path which contains less relationship. I would like that it returns the path where the addition of all Type (the time) is the smallest..
  Is that possible?</p>
  
  <p>Thanks</p>