[Top][All Lists]
[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
Re: [igraph] Edge betweenness community detection on weighted graph
From: |
Gabor Csardi |
Subject: |
Re: [igraph] Edge betweenness community detection on weighted graph |
Date: |
Wed, 5 Mar 2008 14:12:02 +0100 |
User-agent: |
Mutt/1.5.13 (2006-08-11) |
Maria, short answer: not currently. We don't even have a weighted
igraph_betweenness or igraph_edge_betweenness function.
I've added it to the TODO list, but this doesn't mean much, as
we have many things to do....
The Spinglass, Walktrap and fast greedy algorithms support edge weights.
G.
On Wed, Mar 05, 2008 at 04:05:46PM +0300, Maria Grineva wrote:
> Dear Gabor,
>
> I was glad to find igraph lib as it supports modern graph community algorithms
> that is exactly what I need for my application!
>
> My question: is there a way to use community detection based on edge
> betweenness (igraph_community_edge_betweenness) on weighted graph?
>
> Looking forward to see your answer.
>
> Maria Grineva
>
> MODIS team at ISPRAS
> www.modis.ispras.ru
> _______________________________________________
> igraph-help mailing list
> address@hidden
> http://lists.nongnu.org/mailman/listinfo/igraph-help
--
Csardi Gabor <address@hidden> UNIL DGM