> 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
