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
