Re: [igraph] Community detection in unconnected graph

[Gabor Csardi]

On Mon, Mar 31, 2008 at 11:54:26AM +0200, Tamas Nepusz wrote:
> >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

Right, it should be something like:

cl <- clusters(g)
subgraph(g, which(cl$membership == which.max(cl$csize)-1)-1)

G.

> -- 
> T.
> 
> 
> 
> _______________________________________________
> igraph-help mailing list
> address@hidden
> http://lists.nongnu.org/mailman/listinfo/igraph-help

-- 
Csardi Gabor <address@hidden>    UNIL DGM