You are viewing a plain text version of this content. The canonical link for it is here.

Posted to solr-user@lucene.apache.org by Sravani Kambhampati <ks...@vmware.com> on 2021/03/03 08:04:20 UTC

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: Y, child: { ref: Z } }
]
[cid:image001.png@01D71031.E9C961D0]
Thanks,
Sravani