Draft: Better scheduler node evaluation
When evaluating a control flow node for completeness, the scheduler will loop over all children and identify unresolved child nodes.
In the case where the children are sequential, this evaluation scales as n^2: the parent node must be evaluated once for each child, with each evaluation involving a loop over children.
The MR investigates whether caching of already-resolved child nodes can increase the performance of the scheduler.
Edited by Benjamin Michael Wynne