Ok, I will look into it in the next couple of days.
On Fri, May 17, 2013 at 11:01 AM, Tamás Nepusz <[email protected]> wrote: > Dear Gabor, > > There is no solution for your problem yet; the R interface contains a > function named graph.union.by.name but there is no corresponding function > in the Python interface. (The reason is that this is not implemented in C > so each higher level layer has to provide its own solution). If you happen > to come up with a self-contained function that performs this operation, > feel free to put it online somewhere (e.g., gist.github.com) and I will > be happy to merge it with the Python interface if it does not require too > much extra work to integrate. > > Cheers, > Tamas > > On 17 May 2013, at 11:57, Gábor Tóth <[email protected]> wrote: > > > 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 > > > _______________________________________________ > 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
