Assuming it is bounded by some constant depth (e.g. 100), what is the time complexity for GraphAlgoFactory.allSimplePaths? I know this might be a general CS theory question, but I haven't delved into the implementation.
On a non neo4j question, I think the answer is either O(N^3) or O(N^4), I think it's probably the first. but i'm not sure. http://mathematica.stackexchange.com/questions/25779/finding-all-simple-paths-between-two-vertices-in-a-graph Can anyone who knows this well confirm? -- 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/d/optout.
