Re: [igraph] Vertex ID's and Connected Components

[Hillary Ryan]

Thank you for your help Matteo,

I was wondering about attributes, but since the built-in attribute functionality in C was only experimental, I was hoping for another way out. However, on a second pass it doesn't look that bad, so I will go ahead and give it a try.

-Hillary

On Sun, Sep 22, 2013 at 3:19 AM, Matteo Fortini <address@hidden> wrote:

You just need to add an attribute to the vertices before decomposing the graph, as in (Python example)

g.vs['orig_id']=g.vs.indices

then you will be able to find for each vertex the corresponding original one.

HTH,
Matteo

Il 22/09/2013 02:04, Hillary Ryan ha scritto:

Hello everyone,

I am working on a project where I need to do the following steps:

0) Start with a graph G

1) Copy G

2) Randomly remove edges from the copy

3) Find all the connected components of the copy

4) Find one vertex in each component and store it in a vector (V)

5) Find min-cuts between vertices in V in G.

My problem is that the vertex ID's change when the graph is decomposed into components, so I cannot figure out a way to map the vertex ID's back from the component graphs to the original graph, G. Any ideas?

Many Thanks,

Hillary

_______________________________________________
igraph-help mailing list
address@hidden
https://lists.nongnu.org/mailman/listinfo/igraph-help

_______________________________________________
igraph-help mailing list
address@hidden
https://lists.nongnu.org/mailman/listinfo/igraph-help