Find paths between one node and a group of nodes

[Anurag]

Hi @johan-l,
Thanks for your questions. I will try to answer them below.

@johan-l

Do you have any idea how performance heavy that query is? I haven’t used DGraph before so I have a hard time estimating it.

The query which I suggested will be computation intensive. Internally it will try to either find the number off paths you asked for or continue until it visits all the nodes in the process. See runKshortestPaths.

@johan-l

I also assume there is no pagination possible here? If there is, one solution would be to make use of that to save some performance

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 . I do know understand how would pagination work here.