Jaroslav,
you could use shortestPath or allShortestPaths
right now you do an expand over everything.
There is also an expandPath procedure in apoc that could be helpful for
you:
https://neo4j-contrib.github.io/neo4j-apoc-procedures/#_expand_paths
Michael
On Mon, Aug 8, 2016 at 12:59 PM, Alan
Hi Jaroslav,
Although I need more sleep at the moment - your problem seems to have
similar issues to my question about a "query which returns a subgraph"
problem which I've been looking at...
The problem I have with the * operator is that it can is *very* slow.
You also complain that it does
Hi,
I have graph of flights. I want find all flights between two airports
without cycles. How can I clean/disable result of cycles = repeated
sub-paths A-->B-->A-->B.
OK *A-->B-->A*
NOT OK *A-->B-->A-->B*
MATCH path=(source:Airport)-[flights:FLIGHT*]->(destination:Airport)
Thank you for
