[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:27:25 +0200
User-agent: Mozilla/5.0 (Windows; U; Windows NT 6.1; it; rv: Gecko/20110920 Thunderbird/3.1.15

Il 10/10/2011 19:10, Gábor Csárdi ha scritto:
Dear Rossano,

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

According to my understanding, the igraph_disjoint_union function will output a graph where the set of vertices is relabeled before union so to have |V| = |V1|+|V2|. In my problem a node x belonging to both V1 and V2 must appear only once in G but must maintain all edges it had in G1 and G2. It is a sort of superposition of two graphs where common vertices are fused to obtain only one node.

Did I miss any details in the semantic of the igraph_disjoint_union function?

Thank you for your prompt reply

Rossano Gaeta - Associate Professor

Dipartimento di Informatica
Università di Torino

reply via email to

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