YY Ahn
To draw the corresponding hierarchical tree (dendrogram), the program should record the hierarchical information to the file. I think this feature is not so important for the C++ version that...
We don't have any test case yet. It will be useful if the codes become more complex.
It will be useful if the program creates two files containing community strength and partition density for each community at the optimal threshold (or given threshold). The community strength is...
The size distribution of the communities often has a heavy tail. i.e. there are giant communities. In many cases, it is needed to break it down into smaller communities.
Current version use the unweighted partition density for weighted graph. Probably we need weighted partition density for dense networks.
In the README, there is a link to an example .config: http://www.ecogwiki.com/.config?_type=txt However, this example page is not visible ("You don't have a permission").
If you want to cancel your edit and go back to the page, the only way is browser back button, which you need to use several times if you clicked...
We can use https://docs.pytest.org/en/latest/