Traverse Deeply Nested Graph Easily

[MichelDiz]

Hey, see if this can help you too

Flattening to get unique nodes within n steps

This serves? { var(func: eq(name, "NodeA"))@recurse(depth: 140, loop: true) { G as borders } test(func: uid(G), orderasc: name) { n: name } } { "data": { "test": [ { "n": "NodeA" }, { "n": "NodeB" }, { "n": "NodeC" }, { "n": "NodeD" }, { "n": "NodeE" }, { "n": "NodeF" }, { "n": "NodeG" }, { "n": "NodeH" } ]…