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) {!graph from=tgt to=pk}{!graph from=pk to=id}id:A 2. Then from A2 to B using (tgt -> id) {!graph from=id to=tgt} To get from A to C, steps 1 and 2 will be repeated: {!graph from=id to=tgt}{!graph from=tgt to=pk}{!graph from=pk to=id}{!graph from=id to=tgt}{!graph from=tgt to=pk}{!graph from=pk to=id}id:A Likewise, given a start node A, is it possible to query for X when number of hops is unknown, but when query is same for every hop? Thanks, Sravani