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
NULLfor 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
NULLotherwise.- modularity
Modularity value of the community structure. If this is
TRUEand the membership vector is available, then it the modularity values is calculated automatically.
Value
A communities object.
- membership
A numeric vector giving the community id for each vertex.
- modularity
The modularity score of the partition.
- algorithm
If known, the algorithm used to obtain the communities.
- vcount
Number of vertices in the graph.
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(),
membership(),
modularity.igraph(),
plot_dendrogram(),
split_join_distance(),
voronoi_cells()
