How can I find if edges in a subgraph SG appear inside/belong to a graph G?
I have this example with a graph G:
G.Nodes.X = x'; G.Nodes.Y = y';
From the graph G I "extract" a subgraph SG, i.e.:
SG = subgraph(G,[2 3 5 6])
Now I would like to find the edges of SG inside/which belong to G. The answer should be:
How to do it since the nodes in the subgraph SG are renumbered (compared to the graph G)?