Hi Massimo, Check out the cliques(graph, min=NULL, max=NULL) method, I guess, this is what you are looking for. With MIN and MAX you define the size of the cliques.
Best, Claudia On Mar 13, 2012, at 1:58 PM, Massimo Franceschet wrote: > Is there a method in igraph to compute the k-connected components of a graph, > for k > 2 (I am aware that biconnected.components works for k=2 and clusters > works for k=1)? > _______________________________________________ > 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
