@author: KeczerZs

This school project is an implemenation of Newman's (2004a) greedy modularity maximatization algorithm and its improvement by Clauset, Newman and Moore (2004b).

References: Newman, M. E. (2004a). Fast algorithm for detecting community structure in networks. Physical review E, 69(6), 066133. Clauset, A., Newman, M. E., & Moore, C. (2004b). Finding community structure in very large networks. Physical review E, 70(6), 066111.

The code of greedyQ function is also based on networkx library codes by Edward L. Platt

References: https://networkx.github.io/documentation/latest/_modules/networkx/algorithms/community/modularity_max.html https://github.com/networkx/networkx/blob/master/networkx/algorithms/community/modularity_max.py

The test_community.py is the work of Thomas Aynaud et al. (2009). In this project, the implementaiton of the Girvan-Newman test graph generator is used from test_community.py

References: Girvan newman, 2002. PNAS June, vol 99 n 12 https://github.com/taynaud/python-louvain/blob/master/test_community.py https://python-louvain.readthedocs.io/en/latest/