1. clusters(g) 2. Probably something like: cl <- clusters(g)$membership edges12 <- E(g)[which(cl == 1) %--% which(cl == 2)]
Although I don't think there should be any edges between them; otherwise they would be part of the same connected component. The code I list above is what I use to determine edges between communities. On Fri, Dec 5, 2014 at 3:42 PM, patricia <[email protected]> wrote: > Hello > > I would like to ask two questions: > > 1) What function igraph library should I use to determine the connected > components of a graph? > > 2) How can I do to calculate the links (edges) between clusters. For > example, I have a V1 belonging to cluster 1 connected to the V30 that is in > cluster 2, the same happens with many vertices. How can I account for these > edges? > > Thank you > > _______________________________________________ > igraph-help mailing list > [email protected] > https://lists.nongnu.org/mailman/listinfo/igraph-help > >
_______________________________________________ igraph-help mailing list [email protected] https://lists.nongnu.org/mailman/listinfo/igraph-help
