Hi, The nightly snapshot includes a function for weighted edge betweenness calculation, but this has not been incorporated into the edge betweenness-based community detection algorithm. See the following bug:
https://bugs.launchpad.net/igraph/+bug/638174 I guess it wouldn't be too hard to re-implement the community detection algorithm yourself by simply calling edge.betweenness in every step to calculate the edge betweenness scores while considering weights. All the best, -- T. On Wednesday, 18 April 2012 at 17:37, R N wrote: > > Dear all, > > > > > After installing the nightly snapshot > > (igraph.googlecode.com/files/igraph_nightly_0.6-2651-20120316.tar.gz > > (http://igraph.googlecode.com/files/igraph_nightly_0.6-2651-20120316.tar.gz)), > > I saw that the edge.betweenness function uses weights. Furthermore, > > the function has the option of considering directed or undirected > > graphs. It is PERFECT! Thanks, guys! And congrats! > > > > All the best, > > > Charles > > Sorry for disturbing again, but I looked in the sources (the file > igraph-0.6/src/community.c) and > couldn't find any mention of edge weights in the functions related to > edge betwenness; moreover, > in calling 'igraph_modularity', it explicitly passes 0 instead of the > weights vector. Did I overlook something? > Can edge_betweenness actually use edge weights? > > _______________________________________________ > igraph-help mailing list > [email protected] (mailto:[email protected]) > https://lists.nongnu.org/mailman/listinfo/igraph-help _______________________________________________ igraph-help mailing list [email protected] https://lists.nongnu.org/mailman/listinfo/igraph-help
