Broadly speaking, in graph reduction the nodes are functions and values and the edges are steps in the computation that can be taken to apply functions to those values. After application that node becomes a new value, etc. until the program is evaluated or terminated.<p><a href="https:&#x2F;&#x2F;en.wikipedia.org&#x2F;wiki&#x2F;Graph_reduction" rel="nofollow">https:&#x2F;&#x2F;en.wikipedia.org&#x2F;wiki&#x2F;Graph_reduction</a>
<a href="https:&#x2F;&#x2F;en.wikipedia.org&#x2F;wiki&#x2F;Abstract_semantic_graph" rel="nofollow">https:&#x2F;&#x2F;en.wikipedia.org&#x2F;wiki&#x2F;Abstract_semantic_graph</a><p>Generally they&#x27;re acyclic but some types of ASGs can represent recursive functions as cycles, so they are distinct from trees.