Tools, Applications and Methods for Graph Rewriting
Graph Rewriting in a Nutshell
A Graph rewrite rule is a pair of graphs (L, R), where L is called the pattern graph and R the replacement graph.
The actual transformation is done by applying the rule (L, R) to a given host graph H. First of all such an application requires to find an occurrence of the pattern graph L in the host graph H, a task which is often referred to as subgraph matching. Having found an occurrence (or match) of L, it is replaced by a copy of R. This yields a transformed host graph H’.
GrGen is a Graph Rewrite GENerator.
yComp is a graph viewer supporting vcg-files and can be seen as a supersede of the xvcg tool.