You can just take the vertices that *are* in the subgraph isomorphism, and subtract them (as a set) from all vertices. This is a single setdiff call in R I believe.
Gabor On Sep 13, 2015 10:45 PM, "Tamas Nepusz" <[email protected]> wrote: > > I can see that the algorithm can very quickly assess if there is a > subgraph isomorphism. > > Could I use this algorithm to extract the information on which vertices > (edges incident with them) do not obey the subgraph isomorphism? > I don't think there it - the original VF2 implementation does not seem > to reveal this information and igraph only provides a wrapper on top > of the original VF2 implementation that allows us to use it with > igraph graphs. > > Best regards, > T. > > _______________________________________________ > igraph-help mailing list > [email protected] > https://lists.nongnu.org/mailman/listinfo/igraph-help >
_______________________________________________ igraph-help mailing list [email protected] https://lists.nongnu.org/mailman/listinfo/igraph-help
