Does anyone know if this supports (efficient) graph-rewriting?

I'm thinking of this kind of patterns:

If there are nodes n and n' such that

  - there's an edge from n to n' and

  - n has a label XY

then add label Y to n'

So what I'd want to do is match basic patterns and then add nodes, edges, and labels.