Thanks - I have great performance now. I am very confident that if a connection exists in the graph its maximum distance is <=6 relationships away. Using allshortestpaths is giving me what I need and an upperlimit limit of 10 is delivering results in 10s to 100s of ms and the heap is barely touching 1G.
*START a=node(y), b=node(x) MATCH p=allshortestpaths((a)-[*..10]-(b))return p; * This solves my immediate problem Michael. -- You received this message because you are subscribed to the Google Groups "Neo4j" group. To unsubscribe from this group and stop receiving emails from it, send an email to [email protected]. For more options, visit https://groups.google.com/d/optout.
