Re: [igraph] Choosing between different methods of detecting communities

[凌琛]

Hi Gabor,

If I want to use the weighted edge betweenness community detection algorithm in R, is it enough to just use

edge.betweenness.community(G)?

Namely, it is no need to add arguments about edge weights in the graph.

Thanks.

Regards,

chen

On Sat, Sep 29, 2012 at 9:06 PM, Gábor Csárdi <address@hidden> wrote:

On Sat, Sep 29, 2012 at 8:32 AM, 凌琛 <address@hidden> wrote:
> OK, so that if I use similarity of nodes as edge weights, I need to
> transform the weights (i.e., inverse) for detecting community.
> is that right?

I think so, because when you calculate shortest paths, you want edge
weights to represent distances.

Gabor

[...]

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