Suite of community detection algorithms based on Modularity
...Ball et al, An efficient and principled method for detecting communities in networks, 2011.
The suite is based upon the fast community algorithm implemented by Aaron Clauset <aaron@cs.unm.edu>, Chris Moore, Mark Newman, and the R IGraph library Copyright (C) 2007 Gabor Csardi <csardi@rmki.kfki.hu>. It also makes of the classes available from Numerical Recipies 3rd Edition W. Press, S. Teukolsky, W. Vetterling, B. Flanne
...In order to find the network partition that maximizes modularity, the software offers five optimization methods to the user: simulated annealing, fast greedy, spectral partitioning, a hybrid of fast greedy and simulated annealing, and a hybrid of spectral partitioning and simulated annealing. The software is implemented in C language and it uses the igraph library for complex network research.