Filling now works directly on the graph dictionary, thus avoiding many
unnecessary intermediate steps.  Since filling is essentially graph
replication, the time gains are considerable.

The optimized fill is also more faithful to the template graph.