Graph Data Science

Louvain algorithm

A community detection algorithm that repeatedly merges nodes into groups for as long as merging raises modularity.

Also written: Louvain

Example

Two triangles, joined by a single relationship between Cleo and Dan.

cypher
CALL gds.louvain.stream('people')
YIELD nodeId, communityId
RETURN gds.util.asNode(nodeId).name AS person, communityId

Louvain returns two communities, one for each triangle.

Lessons that use this term

The lesson and course links below open in a new tab.

No published lesson uses this term yet.

All glossary terms