|
From: | 凌琛 |
Subject: | Re: [igraph] Choosing between different methods of detecting communities |
Date: | Tue, 2 Oct 2012 18:27:11 +0800 |
edge.betweenness.community(G)?
Namely, it is no need to add arguments about edge weights in the graph.Regards,
chen
On Sat, Sep 29, 2012 at 8:32 AM, 凌琛 <address@hidden> wrote:I think so, because when you calculate shortest paths, you want edge
> 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?
weights to represent distances.
Gabor
[...]
_______________________________________________
igraph-help mailing list
address@hidden
https://lists.nongnu.org/mailman/listinfo/igraph-help
[Prev in Thread] | Current Thread | [Next in Thread] |