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

[Gábor Csárdi]

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

[...]