Due to the fact that the problem of automatically computing a reasonable layout of graph transformation sequences is hard, it has been solved in AGG in a quite simple way up to now.
In the AGG graphs the positions of nodes and edges do not store any syntactic or semantic information, i.e., the layout of a graph is just a matter of presentation for the sake of readability (visibility). That makes it hard to recognize the parts of the graph which have changed, deleted or were newly created after a rule was applied.
But the layout problem is of considerable importance for a user because it is closely related to the mental map of successively transformed diagrams (in our case graphs). This was a reason to develop a new graph layout algorithm which we called ''Evolutionary Layout of Graph Transformation Sequences'' because it considers the evolution of one initial graph over time. To layout graph transformation sequences adequately means to take the layout of transformation rule into account.