Re: [igraph] Dynamic graph clustering using IGraph C library

[Jozef Balaz]

Thanks Tamaz for your feedback,

Does "Community label propagation” function supports dynamic addition of graph 
node?
I don’t want to recalculate the whole graph every time when new node is added 
(only those areas which has changed).

If there is a better way to solve this problem with igraph any recommendation 
is appreciated.

Thanks
Jozef

> On 04 Aug 2015, at 23:40, Tamas Nepusz <address@hidden> wrote:
> 
>> I'm looking for a way to dynamically perform clustering in graph. I have
>> hundred thousands of edges with weighted connections between them and each
>> second about 10 edges are added.  In the igraph for R is an algorithm
>> “cluster_label_prop” but I couldn’t find corresponding algorithm in C version
>> of library.
>> 
>> Is it there but I simply miss it?
> It is called igraph_community_label_propagation in the C core:
> 
> https://github.com/igraph/igraph/blob/master/src/community.c#L2127
> 
> All the best,
> T.
> 
> _______________________________________________
> igraph-help mailing list
> address@hidden
> https://lists.nongnu.org/mailman/listinfo/igraph-help