General description: We have implemented the Girvan-Newman community detection algorithm for weighted graphs in Python.
Implementation period: Oct 2010
The implemented algorithm works as follows .
Girvan-Newman Alg (Input: A weighted graph G, Output: A list of components of G.)
*** You can download the source code for community detection from its github repository: community.
No of lines: 184
Used data structures: Graphs
Used libraries: Python NetworkX & Python Matplolib
 M. Girvan and M. E. J. Newman, Community structure in social and biological networks, Proceedings of the National Academy of Sciences of the United States of America, p.p. 7821--7826, vol. 99, June 2002.
You should follow Follow @kjahanbakhsh me on Twitter.