Dear All, I would need to see the union and possibly sometimes the intersection of two graphs. I know that the intersection and union functions do not support the keeping of attributes, and that is understandable especially because in the two graphs the union of which I am trying to make, the indices do not correspond. However, each vertex and edge has a unique id, an attribute that I wish to use for the union operation. I started to write a script that iterates through all vertices and edges, gets these unique ids, delete duplicates and then builds a new graph out of it. I am wondering if there is any other solution for this.
Thanks, Gabor
_______________________________________________ igraph-help mailing list [email protected] https://lists.nongnu.org/mailman/listinfo/igraph-help
