| Name | Description | Type | Package | Framework |
| EdgeBetweeness | The edge betweenness centrality is defined as the number of the shortest paths that go through an edge in a graph or network. | Class | com.numericalmethod.suanshu.graph.community | SuanShu |
| GirvanNewman | Class | com.numericalmethod.suanshu.graph.community | SuanShu | |
| GirvanNewman .EdgeBetweenessCtor | This allows customization of the computation of edge-betweeness. | Interface | com.numericalmethod.suanshu.graph.community | SuanShu |
| GirvanNewmanUnDiGraph | Class | com.numericalmethod.suanshu.graph.community | SuanShu | |