thispatcher

If we were to define objects as nodes and patchcords as edges, what type of graph would describe a max patcher? would it be a control-flow graph?

If we were to define objects as nodes and patchcords as edges, what type of graph would describe a max patcher? would it be a control-flow g

graph-theory-maxpat-graph-type

Basically it would be a data-flow graph since data (messages) are sent between the nodes (objects). However, the nodes have 2 different types of input connectors, namely "hot" and "cold" inlets. Edges leading to "hot" inlets trigger execution and thus may be considered as control-flow in addition to data-flow.

graph theory: .maxpat graph type?