Mapping is performed as follows. Bijectivity between two graphs is determined incrementally in a greedy manner. We prefer to map the primary nodes first, and then nodes closest to the primary nodes as a function of graph depth. This mapping problem can be phrased as a single bipartite graph containing the two graphs G and H, where the presence of an edge signifies a mapping between the graphs. The goal is to determine the edges in this graph that map G to H, where the edges are weighted by some function. This is the maximum weight matching problem , and we set the weights to be the SMARTS intersection. We maximize the weight sum as a function of each graph depth i,