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
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.