Thank you for the quick reply and the link to the tutorial.

I'm already working with Algebraic Graph Transformation and am looking for proven alternatives. My requirements are pretty high. I use a (unfortunately no longer maintained) framework from Berlin. The great thing: the rules have input and output attributes, I can use the input to influence the attributes of the elements in the left graph. So it also affects the match.

Link: https://www.user.tu-berlin.de/o.runge/agg/

This is my first time reading about the Wolfram language. I'm trying to find out whether graph transformations (regardless of whether they are single push out or double push out) are possible here.

Therefore, unfortunately, no answer here, but a beginner's question: Can I define graph replacement rules with Wolfram?

If yes how?

Thank you very much.