This repository was archived by the owner on Oct 3, 2026. It is now read-only.
Repository navigation
This repository was archived by the owner on Oct 3, 2026. It is now read-only.
Question: What do i do to return a subtree #201
Description
Hello colleagues, lets say i had a graph and i want to return a subtree of a node.
For example query may look like this.
"MAG
.StartFrom($($g.CellId))
.FollowEdge(`"OutEdge`")
.VisitNode(_ => Action.Continue & Action.Return)
.FollowEdge(`"OutEdge`")
.VisitNode(_ => Action.Continue & Action.Return)"
The example above, as i understand, returns only two child nodes. However i don't know the depth of a subtree. It could be a single node or no children at all, or it could be tens of sub-nodes with their sub-nodes. Is there any sample query to extract a sub-tree?
Thanks
Activity
yatli commentedon May 20, 2018
well eosfor for such queries you'll have to use a bounded closure. Yeah it looks like the sample query, just extend the number of hops to what is suitable for you.
Doing unbounded closure is usually a bad idea.
eosfor commentedon May 21, 2018
Thanks Yatao Li (@yatli), maybe i misunderstood something in your answer. Let me clarify the ask. Actually i was talking about a way of representing Depth-first search(DFS) algorithm trough LIKQ query, so to speak. The idea is to traverse the graph to the full depth starting from some node. Is it possible with LIKQ?