This chapter provides explanations and examples for each of the community detection algorithms in the Neo4j Graph Algorithms library.

The following community detection algorithms evaluate how a group is clustered or partitioned, as well as its tendency to strengthen or break apart:

- Louvain (
`algo.louvain`

) - Label Propagation (
`algo.labelPropagation`

) - Connected Components (
`algo.unionFind`

) - Strongly Connected Components (
`algo.scc`

) - Triangle Counting / Clustering Coefficient (
`algo.triangleCount`

) - Balanced Triads (
`algo.balancedTriads`

)