So i have two graphs based on web-crawl data. Turns out they have some common nodes.
>>G1.vs[0] igraph.Vertex(<igraph.Graph object at 0x25b0be0>,0,{'genres': ['Jazz', 'Nu-Jazz', 'Latin'], 'uid': '1000252010'})
>>G2.vs[49] igraph.Vertex(<igraph.Graph object at 0x68c0be0>,0,{'genres': ['Jazz', 'Nu-Jazz', 'Latin'], 'uid': '1000252010'})
for example. i want to merge G1 and G2 into one big graph. However, the web crawls are seperated by time, so the edges incident to G1.vs[0] /= G2.vs[49] necessarily. So i figure i just want to include all connections for both graphs into one new node
Anyway, is there any igraph functions that might help????