community_fast_greedy: Fast Greedy Community Detection

In cograph: Analysis and Visualization of Complex Networks

Fast Greedy Community Detection

Description

Hierarchical agglomeration using greedy modularity optimization. Produces a dendrogram of community merges.

Usage

community_fast_greedy(
  x,
  weights = NULL,
  merges = TRUE,
  modularity = TRUE,
  membership = TRUE,
  ...
)

com_fg(
  x,
  weights = NULL,
  merges = TRUE,
  modularity = TRUE,
  membership = TRUE,
  ...
)

Arguments

x	Network input
weights	Edge weights. NULL uses network weights, NA for unweighted.
merges	Logical; return merge matrix? Default TRUE.
modularity	Logical; return modularity scores? Default TRUE.
membership	Logical; return membership vector? Default TRUE.
...	Additional arguments passed to to_igraph

Value

A cograph_communities object with optional dendrogram

A cograph_communities object. See detect_communities.

References

Clauset, A., Newman, M.E.J., & Moore, C. (2004). Finding community structure in very large networks. Physical Review E, 70, 066111.

Examples

g <- igraph::make_graph("Zachary")
comm <- community_fast_greedy(g)
igraph::membership(comm)

cograph documentation built on April 1, 2026, 1:07 a.m.