[Top][All Lists]

[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]

Re: [igraph] Graphs union

From: Rossano Gaeta
Subject: Re: [igraph] Graphs union
Date: Mon, 10 Oct 2011 19:42:04 +0200
User-agent: Mozilla/5.0 (Windows; U; Windows NT 6.1; it; rv: Gecko/20110920 Thunderbird/3.1.15

Oh, I see. So you would need something like igraph_union(), but with
keeping the multiple edges?

One solution would be to query the edge lists of both graphs, put them
in vectors, concatenate the vectors, and create
a new graph. This might be even faster than igraph_union(), because it
does not look for multiple edges.


Dear Gabor,

that seems an efficient solution: I will try it out. Thank you for the suggestion.


Rossano Gaeta - Associate Professor

Dipartimento di Informatica
Università di Torino

reply via email to

[Prev in Thread] Current Thread [Next in Thread]