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 <[email protected]>wrote: > 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 > source? If that's the case then look at > > https://github.com/neo4j/community/blob/master/graph-algo/src/main/java/org/neo4j/graphalgo/impl/path/AStar.javawhich > is a quite straight forward implementation of the a-star algorithm. > > Best, > Mattias > > 2011/8/9 Reza Ameri <[email protected]> > > > 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 a path that is shorter than all paths in the graph except the one > that > > was the first hit of A* algorithm. I hope I could express my meaning well > > (my English is not really good!) > > Thank you again. > > > > > > > > On Tue, Aug 9, 2011 at 12:06 AM, Mattias Persson > > <[email protected]>wrote: > > > > > 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 <[email protected]> > > > > > > > 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) low weighted paths in my graph? Should I find it by my > > self > > > > and > > > > write a code to handle it or I can find it using Neoj api or other > > query > > > > languages like cypher and gremlin? > > > > Thank you for your great product. > > > > _______________________________________________ > > > > Neo4j mailing list > > > > [email protected] > > > > https://lists.neo4j.org/mailman/listinfo/user > > > > > > > > > > > > > > > > -- > > > Mattias Persson, [[email protected]] > > > Hacker, Neo Technology > > > www.neotechnology.com > > > _______________________________________________ > > > Neo4j mailing list > > > [email protected] > > > https://lists.neo4j.org/mailman/listinfo/user > > > > > _______________________________________________ > > Neo4j mailing list > > [email protected] > > https://lists.neo4j.org/mailman/listinfo/user > > > > > > -- > Mattias Persson, [[email protected]] > Hacker, Neo Technology > www.neotechnology.com > _______________________________________________ > Neo4j mailing list > [email protected] > https://lists.neo4j.org/mailman/listinfo/user > _______________________________________________ Neo4j mailing list [email protected] https://lists.neo4j.org/mailman/listinfo/user
