generate fresh nodes for AG rewrites
efficient AG rewrite for simple graph representation

I implemented an efficient runRewriteGraph for the simple graph
representation. The implementation allocates nodes for the result graph
on the fly. The new implementation is much faster. It is comparable in
performance with the corresponding implementations for the alternative
graph implementations. However, the alternative graph representations
perform better still.