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?
Thanks in advance,
Yérali.
--
View this message in context:
http://main-discussion-list-for-the-graph-tool-project.982480.n3.nabble.com/Problem-with-the-partition-into-communities-tp4027132.html
Sent from the Main discussion list for the graph-tool project mailing list
archive at Nabble.com.
_______________________________________________
graph-tool mailing list
[email protected]
https://lists.skewed.de/mailman/listinfo/graph-tool
