Hi guys, I have a decent size graph (2.5M nodes, 8M relationships) and am interested in finding paths between two nodes. I am using the REST API since the app I am working on is developed in .NET.
Due to the nature of the graph the paths can be quite long, so I am using 8 for the max depth parameter. Searching for the shortest path between two nodes is quite fast. On the other hand, searching for allSimplePaths is really slow. Up to a max depth value of 5 it is still ok, but going further makes it very slow and as I mentioned already, I can have meaningful connections of depth up to 8. I think the reason might be because there may be too many paths between the nodes. Is there any way I can tell the API to return not all paths, but rather just the first 3-4-5 it finds? I think that might speed up things significantly and I don't really need to show more paths than that. Alternatively, if I can ask Neo4j for the next shortest path, after the one I already got, that would also be a great solution. However, I don't expect that there's an easy way to do that. Thanks a lot in advance!! Best regards, Petar -- View this message in context: http://neo4j-community-discussions.438527.n3.nabble.com/Limiting-the-number-of-returned-paths-or-finding-next-shortest-path-tp3507449p3507449.html Sent from the Neo4j Community Discussions mailing list archive at Nabble.com. _______________________________________________ Neo4j mailing list User@lists.neo4j.org https://lists.neo4j.org/mailman/listinfo/user
