Hey everyone … I am new to dgraph, and having some trouble with trying to flatten a set. Basically, I am trying to get a list of all the unique nodes in a query. With a set of bordering nodes, I want to know everything that is within n steps. Here is a sample set: { set { _:a <name> "…

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" …

Flattening to get unique nodes within n steps

Users Dgraph

MichelDiz (Michel Diz) July 31, 2018, 3:50pm 4

Nice! glad it worked for you!

Cheers.

Topic		Replies	Views
Recursion and merging found nodes into a flat list Users	5	1394	June 1, 2018
How to make the query results not duplicate Dgraph kind:question , dgraph	13	652	September 17, 2020
Friends of Friends n hops away Dgraph	8	1742	July 31, 2018
Queries: Tracking recurse node depth OR shortest path to a node of a set of other nodes Dgraph	0	523	August 1, 2020
Traverse Deeply Nested Graph Easily Dgraph	8	2561	August 1, 2018

Flattening to get unique nodes within n steps

Related topics