In a complex directed graph (with various interdependencies) - I am trying to establish the number of underlying nodes for each node.
Example:
a>b
a>c
a>d
c>e
for node a the total children (and grand children,,etc,) are (b,c,d,e) =4
for c it is e (=1) all other would be zero. In this simplistic scenario.
The idea is to come up with a property for every node that indicates the entire downstream (dependent) nodes.
Anything that can be of help here?
