Re: [igraph] Community detection algorithm

[capitano . nemo]

Years!? And then the answer is going to be 42 for sure...

Thanks for the advise.

Francesco


Il 21.11.2013 08:17 Tamás Nepusz ha scritto:
> Hello,
>
> > I have this graph
> >
> > IGRAPH UNWB 79186 13259012
> >
> > and I would like to run a community detection algorithm on it,
> > possibly
> > edge.betweenness.community().
> >
> > I have 2.5 GhZ / 4 GB Memory laptop. I just wonder, is going to be a
> >
> > matter of hours or days to run the function?
>
> edge.betweenness.community() could even take years on this graph as
> you have >13 million edges and all the edge betweenness scores have to
> be recalculated after every edge removal. Try fastgreedy.community()
> or multilevel.community() instead - these should work on the graph
> that you have.
>
> —
> T.
> _______________________________________________
> igraph-help mailing list
> address@hidden
> https://lists.nongnu.org/mailman/listinfo/igraph-help