On 22.03.2017 09:59, yerali wrote:
Dear list, I am new with graph-tools, which looks pretty nice. However, I have the following problem. The result of the partition into communities gives one big community and two very small ones, where the vertices are almost no connected between them. I wonder if I am doing something wrong. My network is directed and unweighted. My algorithm is just: " g2 = load_graph("test.graphml") state = gt.minimize_blockmodel_dl(g2, deg_corr=False) b = state.get_blocks()
for v in g2.vertices(): print v,b[v] " My network has only 50 vertex, is that a limitation?
I don't understand what seems to be the problem. What makes you think that the partition the algorithm finds is wrong? I would help if you were more specific about your data, and what you were expecting. Best, Tiago -- Tiago de Paula Peixoto <tiago@skewed.de>