Given two graphs, I want to find the subgraphs common to both the graphs. I couldn't find anything in igraph which does this. Is anyone aware of such a method in igraph? If not, is there an easy way to do this using existing igraph methods? Seems like boost's graph library offers this facility -
address@hidden. But I would prefer to stick to python.