This is useful to integrate the results of community finding algorithms that are not included in igraph.
Arguments
- graph
The graph of the community structure.
- membership
The membership vector of the community structure, a numeric vector denoting the id of the community for each vertex. It might be
NULL
for hierarchical community structures.- algorithm
Character string, the algorithm that generated the community structure, it can be arbitrary.
- merges
A merge matrix, for hierarchical community structures (or
NULL
otherwise.- modularity
Modularity value of the community structure. If this is
TRUE
and the membership vector is available, then it the modularity values is calculated automatically.
See also
Community detection
as_membership()
,
cluster_edge_betweenness()
,
cluster_fast_greedy()
,
cluster_fluid_communities()
,
cluster_infomap()
,
cluster_label_prop()
,
cluster_leading_eigen()
,
cluster_leiden()
,
cluster_louvain()
,
cluster_optimal()
,
cluster_spinglass()
,
cluster_walktrap()
,
compare()
,
groups()
,
modularity.igraph()
,
plot_dendrogram()
,
split_join_distance()