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 [email protected] https://lists.nongnu.org/mailman/listinfo/igraph-help
