the query looks pretty straightforward but i am no expert
you could try to gradually increase to see when issues arise. 1..2 1..3
1..4 1..5 etc . and whatif you use the shortestpath function
2014-03-25 9:32 GMT+01:00 Antonio Grimaldi <antonio.grimaldim...@gmail.com>:
> Hi Koen
>
> I have not included the limit 1 .. 4 because I'm implementing a routing
> algorithm, and then I do not know how many nodes and edges I have to cross
> to calculate the route between two locations.
>
> Do you have a solution to my problem?
>
> Thank you very much
>
> 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 neo4j+unsubscr...@googlegroups.com.
> For more options, visit https://groups.google.com/d/optout.
>
--
Groeten / Best Regards,
Koen
--
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 neo4j+unsubscr...@googlegroups.com.
For more options, visit https://groups.google.com/d/optout.
