Neo4j - Finding the Shortest Path between two nodes based on relationship property
<p>I'm trying to figure out if there's someway to get the shortest distance between two nodes based in a relationship sum, given this example:
<a href="http://i.stack.imgur.com/fiJe1.png" rel="nofollow">neo4j image example</a></p>

<p>Code for image above:</p>

<pre><code>CREATE (some_point_1:Point {title:'Some Point 1'})
CREATE (some_point_2:Point {title:'Some Point 2'})
CREATE (some_point_3:Point {title:'Some Point 3'})
CREATE (some_point_4:Point {title:'Some Point 4'})
CREATE (some_point_5:Point {title:'Some Point 5'})
CREATE (some_point_6:Point {title:'Some Point 6'})

CREATE (some_point_1)-[:distance {value:100}]-&gt;(some_point_2)
CREATE (some_point_2)-[:distance {value:150}]-&gt;(some_point_4)
CREATE (some_point_1)-[:distance {value:200}]-&gt;(some_point_3)
CREATE (some_point_3)-[:distance {value:300}]-&gt;(some_point_4)
CREATE (some_point_2)-[:distance {value:500}]-&gt;(some_point_5)
CREATE (some_point_4)-[:distance {value:300}]-&gt;(some_point_5)
CREATE (some_point_5)-[:distance {value:300}]-&gt;(some_point_6)
CREATE (some_point_6)-[:distance {value:300}]-&gt;(some_point_1)
</code></pre>

<p>In this example the shortest path should be:
some_point_1 > some_point_2 > some_point_4 > some_point_5 (100+150+300 = 550)</p>

<p>Is something like this possible with Cypher?</p>