Module org.jgrapht.core
Package org.jgrapht.alg.clustering

Class GreedyModularityAlgorithm<V,E>

java.lang.Object
org.jgrapht.alg.clustering.GreedyModularityAlgorithm<V,E>
Type Parameters:
V - the graph vertex type
E - the graph edge type
All Implemented Interfaces:
ClusteringAlgorithm<V>
public class GreedyModularityAlgorithm<V,E> extends Object implements ClusteringAlgorithm<V>
The Greedy Modularity algorithm.

The algorithm partitions the vertices of an undirected graph into communities by greedily maximizing the modularity of possible communities. Greedy modularity maximization begins with each node in its own community and repeatedly joins the pair of communities that lead to the largest modularity until no further increase in modularity is possible (a maximum).

The algorithm is due to Clauset, Newman and Moore. It is described in detail in the following paper:

  • Clauset, A., Newman, M. E., & Moore, C. “Finding community structure in very large networks.” Physical Review E 70(6), 2004.

Author:
Antonia Tsiftsi