Graph query from A to X[n] when number of hops is not known

Hi, How to graph query from A to X where number of hops is not known, but when graph query for each hop remains same. For example: If my graph looks like this, id:A -> pk:A1 -> tgt:A2 id:B -> pk:B1 -> tgt:B2 ... id:X To get from A to B, 1. We query A to A2 using (id->pk) + (pk -> tgt) {!gr

FW: Graph traversal when nodes are indirectly connected with references

I have a graph with disjoint sets of nodes connected indirectly with a reference as shown below. Given an id is it possible to get the leaf node when the depth is unknown? [ { id: A, child: { ref: B } }, { id: B, child: { ref: C } }, { id: C, child: { ref: D } }, . . { id