Hi every one,
I'm really new to Neo4j and really shocked of this big and useful DBMS that
seems to solve any problem that I have!
after working on the neo4j in my java application, I could finally create an
astar traverse, which is really cool! But there is one other need, how can I
find top (n) lo
Hi Reza,
glad to hear you're happy using Neo4j!
By low weighted paths do you mean the Dijkstra algorithm, where each
relationship is associated with a cost and you'd like to find the cheapest
paths? In that case try GraphAlgoFactory#dijkstra
2011/8/8 Reza Ameri
> Hi every one,
> I'm really new
Hi Mattias,
Yeah, me too, Neo4j is really more awesome than I thought!!!
The fact is that I could find the shortestPath in my weighted graph using
astar algorithm from GrapgAlgoFactory and traversed it node by node. The
case is to find next shortestPath after traversing current shortestPath, I
mean
Oh ok, now I understand what you mean. The implementation today only returns
the one single best path found, but I think it would be easy to make it also
return a specified amount of next-best paths. I'll put it my backlog of
things. In the meantime are you comfortable looking at/modifying java
sou
Thanks, I am working on it for days. Do you think it is easy to return
next-best path?
I will work on this code and any inform you and all the list in the case of
success.
I you've got some idea please let me know.
Thank you
On Tue, Aug 9, 2011 at 12:32 PM, Mattias Persson
wrote:
> Oh ok, now I
Cool, I just though it might be easy... but I can be mistaken of course. I
haven't really got the time to look more into it a.t.m. but keep us posted
on progress!
2011/8/9 Reza Ameri
> Thanks, I am working on it for days. Do you think it is easy to return
> next-best path?
> I will work on this
Oh! Please,
I have no idea how to change the algorithm! Please tell me your idea may be
it helped me to find a new algorithm.
Thank you again.
On Tue, Aug 9, 2011 at 1:36 PM, Mattias Persson
wrote:
> Cool, I just though it might be easy... but I can be mistaken of course. I
> haven't really got
I haven't got a clear idea of how to change it, I just though initially that
it wouldn't be all that hard. If I get the time I'll have a look
2011/8/9 Reza Ameri
> Oh! Please,
> I have no idea how to change the algorithm! Please tell me your idea may be
> it helped me to find a new algorithm.
>
le.com/p/k-shortest-paths/
--
View this message in context:
http://neo4j-community-discussions.438527.n3.nabble.com/Neo4j-finding-top-10-shortest-path-tp3235128p3330443.html
Sent from the Neo4j Community Discussions mailing list archive at Nabble.com.
___
Neo
investigacao/r_papers.html#K
> [2] http://code.google.com/p/k-shortest-paths/
>
> --
> View this message in context:
> http://neo4j-community-discussions.438527.n3.nabble.com/Neo4j-finding-top-10-shortest-path-tp3235128p3330443.html
> Sent from the Neo4j
entificos/investigacao/r_papers.html#K
> > [2] http://code.google.com/p/k-shortest-paths/
> >
> > --
> > View this message in context:
> http://neo4j-community-discussions.438527.n3.nabble.com/Neo4j-finding-top-10-shortest-path-tp3235128p3330443.html
> > Sent
11 matches
Mail list logo
