* The layout hash is used during the equivalency checking. We have a node in * the child graph that may be equivalent to a node in the parent graph. To * find the corresponding node (if any) in the parent, we need a quick way to * get to all nodes in the parent that look like the node in the child. Since a * large number of nodes don't have names, we need to incorporate the layout of * the