Re: [igraph] Community detection in unconnected graph

[Tamas Nepusz]

> It is a pity that my graph is not connected, so the  
> walktrap.community and spinglass.community can not handle it.  
> However, I am only interested in the largest cluster of the graph,  
> how can I do that?
Use clusters(...) to determine the connected components of the graph,  
then find the largest one and use subgraph(...) to extract it. See:
http://cneurocvs.rmki.kfki.hu/igraph/doc/R/clusters.html

--
T.