But you should already get paths back? Can you describe your graph shape? Remember cycles don't work well there.
Could you update your version to 1.9.6 or 2.0.1 ? I think you could use a custom PathExpander that just doesn't return anything anymore or throws an exception when a certain time limit is reached. Am 04.03.2014 um 16:12 schrieb Guru <[email protected]>: > I am using Java API in an embedded graph (version 1.9.4) and using the > following code to get the ShortestPath - > GraphAlgoFactory.shortestPath(expander, 15) > where expander is a expander with specific relationship types. > > In rare cases, the graph (which is about 28 G on a JVM sized to 10G) just > spins for more than 30 minutes. > Is there a way to specify the timeout so that shortestPath query is cancelled? > > -- > You received this message because you are subscribed to the Google Groups > "Neo4j" group. > To unsubscribe from this group and stop receiving emails from it, send an > email to [email protected]. > For more options, visit https://groups.google.com/groups/opt_out. -- You received this message because you are subscribed to the Google Groups "Neo4j" group. To unsubscribe from this group and stop receiving emails from it, send an email to [email protected]. For more options, visit https://groups.google.com/groups/opt_out.
