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

Reply via email to