Community Algorithms

Algorithm links: Community Algorithms

Community algorithms group together vertices or edges that satisfy some rule for being connected to one another. Community algorithms are different from classification algorithms because classification does not necessarily consider connections.

The TigerGraph Graph Data Science Library provides the following community algorithms:

Weakly Connected Components
- WCC (Small-World Optimized)
k-Core Decomposition
Label Propagation
Speaker-Listener Label Propagation
Local Clustering Coefficient
Louvain
Strongly Connected Components
- SCC (Small-World Optimized)
Triangle Counting