Please give us a bit of time. We'll get back to you soon.
Michael On Wed, Mar 26, 2014 at 10:31 AM, Antonio Grimaldi < [email protected]> wrote: > Hi Michael, > I'm trying to duplicate and modify > the org.neo4j.graphalgo.impl.path.Dijkstra code by myself. > But, i can't find where i have to remove the limit... > Can you help me? > > Thank you > Antonio > > > Il giorno martedì 25 marzo 2014 09:20:19 UTC+1, Antonio Grimaldi ha > scritto: > >> i tried to execute this cypher query : >> >> StringBuilder sb = new StringBuilder("START startNode = node(269604), >> endNode = node(269605) >> MATCH path=(startNode)-[:CAR_MAIN_NODES_RELATION*]->(endNode) >> RETURN path AS shortestPath, reduce(cost=0, rel in relationships(path) | >> cost + rel.edgeLength) AS totalCost >> ORDER BY totalCost ASC >> LIMIT 3") >> >> ResourceIterator<Object> pathsList = this.executionEngine.execute(sb. >> toString()).columnAs("shortestPath"); >> >> but, after 10 minutes, I have not had any results yet... >> >> My graph had 157689 nodes and 1063621 edges. >> > -- > 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. > -- 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.
