Tutorial example CircleBranched
Files
In CircleBranched the update graph is defined by
- perimeterNode | areaNode -> radiusNode
- radiusNode -> perimeterNode
- radiusNode -> areaNode
The update graph now has two cycles
- perimeterNode->radiusNode->perimeterNode
- areaNode->radiusNode->areaNode
Since one of the cycles may not contain the Trigger Node, recursion is stopped explicitly by a test in getRadius.
While this accounts for some extra code, the formulation of dependencies now looks more natural than with the single cycle update graph.