# Summary of flow graphs

For languages with non-trivial computation, we can draw three-coloured flow graphs for programs.

- Value nodes can be copied, discarded, and evaluated in any order.

- Central nodes cannot be copied or discarded, but can be evaluated in any order.

- Process nodes cannot be copied or discarded, and order of evaluation is important.

Edges are either data flow or control flow.