FindIsomorphicSubgraph[g1,g2] finds a subgraph of g1 that is isomorphic to g2. That is a great addition. It seems to do its calculations simply based on vertices and their interconnections. My question is this: Is there a version or some sort of workaround that would also take into consideration the weights of the edges?
So, very simplistically: a->b is isomorphic to 1 -> 2
But say I have edge weights can I still have a function that finds an Isomorphic subgraph while also taking into account the weights of the edges. For instance:
a -> b (weight 2) and 1->2 (Weight 2) are isomorphic. And if I allow for some tolerance (perhaps by using the function Around[x,{d-,d+}] is there a function that would find that
a->b (weight 2) and 1->2(weight 2.3) are isomorphic if I allow a tolerance of 15% for the edge weights?
So, basically, I am trying to a have a function that will find that two graphs with edge weights are isomorphic not simply structurally but when the weights are similar, where similarity is based on the Around[] function.