StackOverflowError while using Dijkstra from myPlugin

[Eugeny Kozhanov]

Hi to all!

I try use Dijkstra from myPlugin, but get error:

{
  "exception" : "StackOverflowError",
  "stacktrace" : [ "java.util.LinkedList.addLast(LinkedList.java:181)", "org.neo4j.graphalgo.impl.shortestpath.Util.constructAllPathsToNodeAsNodeLinkedLists(Util.java:230)", "org.neo4j.graphalgo.impl.shortestpath.Util.constructAllPathsToNodeAsNodeLinkedLists(Util.java:209)",
...
}

I call dijkstra via follow script:

 Dijkstra<Double> pathFinder = new Dijkstra<Double> (0.0, nodeFrom, nodeTo,
 new RouterCostEvaluator(cost), new DoubleAdder(), new DoubleComparator(), Direction.OUTGOING, drt );
 pathFinder.limitMaxCostToTraverse( maxCost );
 pathFinder.getPathsAsNodes();

Why?

[Eugeny Kozhanov]

pathFinder.limitMaxNodesToTraverse(100000);

- works good

pathFinder.limitMaxNodesToTraverse(1000000);

- get error

[Eugeny Kozhanov]

Can I use Dijkstra without "pathFinder.limitMaxNodesToTraverse(100000);" ?

[Mattias Persson]

Could you use the public Dijkstra implementation instead? I.e. org.neo4j.graphalgo.impl.path.Dijkstra, accessible fom GraphAlgoFactory

2012/10/10 Eugeny Kozhanov <vin...@gmail.com>

Can I use Dijkstra without "pathFinder.limitMaxNodesToTraverse(100000);" ?

--
 
 

--
Mattias Persson, [mat...@neotechnology.com]
Hacker, Neo Technology
www.neotechnology.com

[Eugeny Kozhanov]

Can this Dijkstra class may return some shortest paths? The findSinglePath  method  return only one path. The findAllPaths method working too long time...

[Eugeny Kozhanov]

And findSinglePath method is very hard (need more memory and CPU time)...