TreeLayout node aggregation question

Does GoJS have build-in functionality allowing child data node aggregation? For example, if Child1.someField=2 and Child2.someField=3, then I would like Parent.someField=5, …and so on, recursively.

I seem to remember d3 has an aggregate construct for trees but I can’t seem to find in the docs/samples in Go.

I’m delving into trees now for the first time, so if there’s a GoJS recursive construct I’m missing which would help me avoid doing server-side aggregation it’d be ideal.



No, it’s not built-in. But it’s easy to implement.

This is not the same as what you are asking for, but it does remind me of it: Tournament

Thanks Walter!