[Top][All Lists]

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

Re: [igraph] Graphs union

From: Gábor Csárdi
Subject: Re: [igraph] Graphs union
Date: Mon, 10 Oct 2011 13:10:06 -0400

Dear Rossano,

it seems to me that you simply need the igraph_disjoint_union function:


On Sat, Oct 8, 2011 at 11:42 AM, Rossano Gaeta <address@hidden> wrote:
> Dear all,
> I would like to use the C library to solve the following problem: given two
> graphs G1 and G2 I need
> 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.
> Can anybody suggest an efficient solution? I may be wrong but it seems that
> graph operators functions in
> igraph do not support this kind of union.
> Thank you in advance
> Regards
> Rossano Gaeta
> --
> Rossano Gaeta - Associate Professor
> Dipartimento di Informatica
> Università di Torino
> Corso Svizzera 185, 10149, Torino, Italia
> _______________________________________________
> igraph-help mailing list
> address@hidden
> https://lists.nongnu.org/mailman/listinfo/igraph-help

Gabor Csardi <address@hidden>     MTA KFKI RMKI

reply via email to

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