You will have to provide much more detail for anyone to help you. More info about your dataset (or a copy of the db).
And the exact way of how you invoke shortest-path and dijkstra (including database and memory settings) Michael > Am 16.11.2015 um 16:58 schrieb luca scipioni <[email protected]>: > > Hi there. I have a problem with dijkstra algo. I created a plugin that finds > the shortest path between two nodes but is very slow. With cypher i have a > response in one minute(because i run the query on a list of end nodes). > Somebody can help me? > > Cheers. > Luca. > > -- > 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] > <mailto:[email protected]>. > For more options, visit https://groups.google.com/d/optout > <https://groups.google.com/d/optout>. -- 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.
