  A graph is a pair (G,→), where → is a relation on G (a set of ordered pairs from G).  The idea is that we want to think of a graphs as notations for sets, just as systems of equations were notation for streams. This is explained by the concept of a decoration: A decoration d of a graph G is a function whose domain is G and with the property that