I need something exactly like this! I’d like to be able to achieve it without writing something like a python meta-class to wrap each of the types in and have it track the propagation of results from each layer into one another. What I just mentioned seems necessary because while you can list children, there doesn’t appear to be anything in that iterator that guarantees what each child is fed as a parameter. For example, the iterator order doesn’t guarantee that the each child is feeding the next it’s result, or really any structure regarding the graph at all. Listing the children is a lot like enumerating the nodes of a graph - there are no edges!!
How to get “edges” of the graph?