NamedGraph, attempt #2

See if this refactoring is a better fit for everyone.
This works for my use case, but there is still the question of what to do if renaming causes nodes/edges to merge. Currently I simply use the union of :adj and :in sets of the two merging nodes, on unweighted graphs. A more general approach might be of interest in weighted case, for sure, and maybe in unweighted as well. Some test.check of different rename-nodes implementations added, as well.

I synced my fork, so it should be easy to see what was added. Let me know what you think.
Why is AOT compilation of loom.graph necessary?