Java implementation of the Louvain method for community detection.
Input: weighted, undirected graph, defined in a CSV file as a list of edges. See the graphs at src/test/resources for examples. If nodes are named or non-zero indexed they can also be read.