[Top][All Lists]
[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
Re: [igraph] Graphs union
|
From: |
Yiorgos Adamopoulos |
|
Subject: |
Re: [igraph] Graphs union |
|
Date: |
Mon, 10 Oct 2011 12:05:09 +0300 |
On Sat, Oct 8, 2011 at 6:42 PM, Rossano Gaeta <address@hidden> wrote:
> to obtain a new graph G=(V,E) where V=V1 U V2 (V1 and V2 are not disjoint)
> and E=E1 U E2 (I need to maintain multiple
> edges in the resulting graph). In general, graphs to be merged this way may
> be more than two.
I would create the adjacency matrix of G and then work with igraph
--
http://gr.linkedin.com/in/yiorgos