Given DAG (Directed Acyclic Graph) stored in Nebula-graph, I need to get all the decedents of a node using one query executed on the server side. In ‘Go n steps from’ we need to specify the number of steps of depth. How can I do something like bring all the nodes without giving specific step count.
Is there a play around for that? any ideas to do it in programming ( I am using JAVA API client)?
My main goal to reduce the network overhead of the operation by having the server do it on its side.
“get all the decedent of a node” there are two directions from there:
- Get all related nodes of a known node v1，such as v1->v2; v1->v3; v1->v4 … , expected (v2, v3, v4,…)
- traverse the graph from a known node v1, shch as v1->v2->v3->v4 …, expected (v2, v3, v4,…)
I need to get all the nodes reachable from v1 for infinite number of hops . As per the previous example that mean 1+2.
Thank you in advance