On Fri, Dec 5, 2014 at 3:51 PM, Chris Watson <[email protected]> wrote: > 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.
Right. A small correction is that you can have edges between strongly connected components in directed graphs. Gabor [...] _______________________________________________ igraph-help mailing list [email protected] https://lists.nongnu.org/mailman/listinfo/igraph-help
