Skip to content

Instantly share code, notes, and snippets.

@langsdlc
Created July 19, 2016 19:47
Show Gist options
  • Save langsdlc/553fb496b9e70e39437aac589cfc0fed to your computer and use it in GitHub Desktop.
Save langsdlc/553fb496b9e70e39437aac589cfc0fed to your computer and use it in GitHub Desktop.
start n=node(1779), p=node(1645)
match s=shortestpath((n)-[r]-(p))
return n,r,p
start n=node(1779), p=node(1645)
match s=shortestpath((n)-[r]-(p))
return reduce(totalDistance = 0, n in relationships(s) | totalDistance + n.distance) as feet
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment