[Top][All Lists]

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

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

From: Matteo Fortini
Subject: Re: [igraph] Vertex ID's and Connected Components
Date: Sun, 22 Sep 2013 09:19:08 +0200
User-agent: Mozilla/5.0 (X11; Linux x86_64; rv:17.0) Gecko/20130801 Thunderbird/17.0.8

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


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


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,

igraph-help mailing list

reply via email to

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