Hi, Yes you are right, now it works! Thank you very much!
May I ask you one last question? You told me, that the Optimal Modularity Algorithm works only for networks with 30-40 nodes. So it's not usable for my pretty large network. But do you know how long it would take to compute the community structure in this network with 307 nodes and 21'406 edges on a server with 4 cores, each 3 GHz, and 8 gb RAM? Is there kind of a calculation rule to compute the calculation time? Best Regards, Stefanie > From: nta...@gmail.com > Date: Wed, 28 Nov 2012 21:13:29 +0100 > To: igraph-help@nongnu.org > Subject: Re: [igraph] Fastgreedy Algorithm for Community Detection in igraph > for RStudio - fatal error. > > Hi, > > > g_adjacency_undirected_weighted_connected <- > > graph.adjacency(adjacency_matrix_undirected_unweighted_connected) > The graph you create here will be directed because graph.adjacency creates > directed graphs by default. Add mode="undirected" to make the graph > undirected. Other than that, your code works perfectly fine for me in the > command line version of R. > > Best, > Tamas > _______________________________________________ > igraph-help mailing list > igraph-help@nongnu.org > https://lists.nongnu.org/mailman/listinfo/igraph-help
_______________________________________________ igraph-help mailing list igraph-help@nongnu.org https://lists.nongnu.org/mailman/listinfo/igraph-help
