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(2
Hi Michael
do you have any suggestion about this?
Thank you
Antonio
--
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 optio
Hi,
Are there some news?
Thanks
Antonio Grimaldi
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)-[
Hi Michael,
Can you give me some news ?
Thanks
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)-[:C
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 <
antonio.grimaldim...@gmail.com> 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 wher
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
Thank You Michael
I'll wait anxiously for your reply here..
This is really a problem for me..
Antonio Grimaldi
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 = nod
Thank you Michael.
I'll anxiously wait your response in this regard.
This is a very problem for me.
thanks
Antonio Grimaldi
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 s
Hi,
we'll fix the iterator for dijkstra and aStar until then it is probably
easiest to duplicate the dijkstra code and remove the limit. I asked
someone in the team to provide some pointers on SO.
If I find time, I can try to look into it.
Cypher won't help you here it is not (yet) optimized for
Hi Michael,
Sadly on stackoverflow i had no usefull answer; I'm still blocked on how to
find N shortest weighted paths in neo4j; can I use any other utility in
order to calculate it (e.g. gremlins, graphjung or other?)
I'ld like to create a new graphgist by dumping my full DB but in my DB I
ac
Wasn't your question already answered on stackoverflow?
Sent from mobile device
Am 25.03.2014 um 16:44 schrieb Antonio Grimaldi
:
> no one can help me?
>
> Il giorno martedì 25 marzo 2014 09:20:19 UTC+1, Antonio Grimaldi ha scritto:
>>
>> i tried to execute this cypher query :
>>
>> StringB
Can you create a graphgist?
On Tue, Mar 25, 2014 at 11:44 AM, Antonio Grimaldi <
antonio.grimaldim...@gmail.com> wrote:
> no one can help me?
>
> Il giorno martedì 25 marzo 2014 09:20:19 UTC+1, Antonio Grimaldi ha
> scritto:
>>
>> i tried to execute this cypher query :
>>
>> StringBuilder sb = n
no one can help me?
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*]->(en
Ok, now i tried this :
START startNode = node(307093), endNode = node(307094)
MATCH path=allShortestPaths((startNode)-[:CAR_MAIN_NODES_RELATION*]->(
endNode))
RETURN path AS shortestPath, reduce(cost=0, rel in relationships(path) |cost
+ rel.edgeLength/rel.edgeRtSpeed) AS totalCost ORDER BY tot
I agree with Koen, for routing you should use shortestPath.
On Tue, Mar 25, 2014 at 10:38 AM, Koen Kleingeld wrote:
> and something like
>
> shortestPath((startNode)-[:CAR_MAIN_NODES_RELATION*]->(endNode))
> or allShortestPaths(startnode)-->(endnode))
>
>
> 2014-03-25 10:13 GMT+01:00 Antonio Gr
and something like
shortestPath((startNode)-[:CAR_MAIN_NODES_RELATION*]->(endNode))
or allShortestPaths(startnode)-->(endnode))
2014-03-25 10:13 GMT+01:00 Antonio Grimaldi
:
> i tried 1..4 and the query ends in 170ms.
> But obviously no path between two very distant locations is found ( this
>
i tried 1..4 and the query ends in 170ms.
But obviously no path between two very distant locations is found ( this is
the reason because i can't limit the number of nodes and edges).
Il giorno martedì 25 marzo 2014 09:20:19 UTC+1, Antonio Grimaldi ha scritto:
>
> i tried to execute this cypher q
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 :
> Hi Koen
>
> I have not included the limit 1 .. 4 because
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
19 matches
Mail list logo
