Hello, I am currently trying to implement a graph traversal feature across multiple shards.
Is there a way of making gatherNodes() to work for infinite depth, until it
reaches the leaves, as if the local graph query does?
Local graph query( {!graph … } ) won’t work across shards, and nested
gatherNodes() is not applicable since the input may not specify the depth.
If that is not possible, is there a way of avoiding nested gatherNodes() call
for searching multiple depths, and/or making it faster?
