- Build directed graph of dependencies
- Evaluate directed graph breadth first for every tick.
graph is actually
hard constant root get function always returns a guarranteed state.
connector nodes are the ent.i nodes loosey goosey connector node which has a get function that returns the parents val (in this case the const).
The actual nodes