Find paths between one node and a group of nodes

There are two shortest path functions implemented internally: shortestPath and runKshortestPaths. The former returns one path and the latter returns (or tries to return) total numPaths in ascending order of the distance .

Thanks, thats excellent!

Happy to work with you on this if you could provide more information on schema and data.

Sorry my posts became quite messy since I couldn’t edit the original one (time ran out). I sorted this issue out myself, it was an error in my data as mentioned in the post above.

Also what would you have liked to see more of in the documentation? Tagging our technical writers @damian and @acarey who can help us get our documentation upgraded.

I’m pretty sure the issue was that I were querying the data in the wrong order, and wherefore the returned results were empty. I originally assumed that is must be somethings wrong with the Query and since the documentation only had one example and not too much explanation on my issue I felt stuck.

I ended up re-seeding the database and make sure all edged were in the right direction, which got it working.

Thank you once more for the excellent support!

1 Like