I want to find shortest weighted path between two nodes. Running apoc shortest path between those two nodes returns almost instantly (nodes are 2 hops away from each other).
However, if I run Dijkstra against the same nodes it runs essentially for ever if there a better way (OOTB) to do this? Perhaps limiting the number of attempted hops Dijkstra takes? --- This email has been checked for viruses by Avast antivirus software. https://www.avast.com/antivirus -- 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.
