Dear igraph-helpers,
this morning's idea was not so good, it is not sufficient to just permute the outer nodes, the inner ones have to be permuted with them. So I cannot use graph isomorphism without colors. However, I suppose that graph isomorphism with colors is also not the best solution to my problem. It would be easy in terms of writing the code, but presumably quite slow in many applications. I may have to write something specific, because there is a strong structural relation between inner and outer vertices, and they would have to be permuted alongside according to that relation.
Well, my enthusiasm that graphs solved my previous problem so easily made me a bit too optimistic on this one ...
Regards,
Ulrike
|