I have two graphs, G1 and G2, which I know are isomorphic. I want to map the nodes of G1 to G2. However, there are many possible isomorphisms. I would like to find a mapping that considers the lengths of the edges in both graphs. The edge lengths in G1 and G2 are similar but not exactly the same.
Additionally, I have information about distances between non-connecting nodes in both graphs. In the figure, the non-connecting nodes are illustrated as being connected with red edges for example purposes, but these red edges do not actually exist in the graphs. How can I use this information to determine the node correspondence between the two graphs?
I'm not sure if such a feature exists, so any help in this regard would be greatly appreciated.