Thank you Renita.
I Love the filter formula and using it all the time!
However, I still can’t seem to find a way to filter the table and also go more than 2 levels deep.
For now, I used ListCombine and CountUnique but that doesn’t resolve it completely and I can’t get rid of the completed tasks.
I have not really attempted it myself but I would assume that to handle exploring the dependency chain arbitrarily deep (upstream from a dependency), then you would need some sort of graph traversal algorithm. This would need to find an upstream dependent, count it, and then explore its upstream dependents and so on. You would need some sort of data structure to track which upstreams remain to be explored. It would be some list of the upstreams, which is both iterated on by the .ForEach() (until empty) and within the loop body you would be adding the upstream dependents as they are discovered to that list. I have not experimented with this and not sure if possible.