I think so, yes. Michael
Am 12.05.2014 um 15:47 schrieb Antonio Grimaldi <[email protected]>: > Good work, thank you very much.. > Do you know if it is a final work? > > Thanks > 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.
