## What I want to do

I want to count all children of a node recursively until every node has been traversed. You can think of it as a nested comment situation. Where you have, for instance, a forum post with comments and in turn an infinite amount of replies to each comment. And each reply can also have several replies and so forth. The task would be to calculate the total number of all replies for each top-level comment. In this scenario, the relationship is a tree-like structure.

I have been trying this for a while now, but could not come up with a query that solves this. I also didnâ€™t find a similar question or a matching example in the docs.

## What I did

Schema:

```
_:a <name> "Alpha" .
_:a <owns> _:b .
_:b <owns> _:c .
_:c <owns> _:d .
_:c <owns> _:e .
_:c <owns> _:f .
_:f <owns> _:g .
```

I want to know how many Nodes are totally owned by `Alpha`

(answer is 6)

If I run this query

```
{
q(func: eq(name, "Alpha")) @recurse {
count(owns)
}
}
```

I get the result 1. So if I try to aggregate them, I get an error:

```
{
q(func: eq(name, "Alpha")) @recurse {
c as count(owns)
}
res() {
sum(val(c))
}
```

I only know how to do it the complicated way:

```
{
q(func: eq(name, "Alpha")) {
name
c as count(owns)
owns { d as count(owns)
owns { e as count(owns) }
}
res: math(c + d + e)
}
}
```