Re: [Neo] Cost limit option in Dijkstra Algorithm

2010-01-27 Thread Nabeel Siddiqui
://gremlin.tinkerpop.com- PageRank in 2 lines of code. On Tue, Jan 26, 2010 at 10:06 AM, Nabeel Siddiqui nabeelmukh...@yahoo.com wrote: Hi all Thanks Peter for adding a cost limit option to the Dijkstra algorithm in the graph algo package. However for some reason I could not make it to work

[Neo] Cost limit option in Dijkstra Algorithm

2010-01-26 Thread Nabeel Siddiqui
Hi all Thanks Peter for adding a cost limit option to the Dijkstra algorithm in the graph algo package. However for some reason I could not make it to work as I expected. I see you have added some tests in FindPathTest#testMaxCost method (which is given below): public void testMaxCost()

Re: [Neo] Limiting Dijkstra's search algorithm to maximum degrees of depth.

2009-10-14 Thread Nabeel Siddiqui
degrees of depth. Hi! If you have an unweighted graph, you could look into using the FindSinglePath class: http://components.neo4j.org/graph-algo/apidocs/org/neo4j/graphalgo/shortestpath/FindSinglePath.html /anders Nabeel Siddiqui wrote: Hi All I have a question about the graph algo