1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
|
% Generated by roxygen2: do not edit by hand
% Please edit documentation in R/community.R
\name{groups}
\alias{groups}
\alias{groups.default}
\alias{groups.communities}
\title{Groups of a vertex partitioning}
\usage{
groups(x)
}
\arguments{
\item{x}{Some object that represents a grouping of the vertices. See details
below.}
}
\value{
A named list of numeric or character vectors. The names are just
numbers that refer to the groups. The vectors themselves are numeric or
symbolic vertex ids.
}
\description{
Create a list of vertex groups from some graph clustering or community
structure.
}
\details{
Currently two methods are defined for this function. The default method
works on the output of \code{\link[=components]{components()}}. (In fact it works on any
object that is a list with an entry called \code{membership}.)
The second method works on \code{\link[=communities]{communities()}} objects.
}
\examples{
g <- make_graph("Zachary")
fgc <- cluster_fast_greedy(g)
groups(fgc)
g2 <- make_ring(10) + make_full_graph(5)
groups(components(g2))
}
\seealso{
\code{\link[=components]{components()}} and the various community finding
functions.
Community detection
\code{\link{as_membership}()},
\code{\link{cluster_edge_betweenness}()},
\code{\link{cluster_fast_greedy}()},
\code{\link{cluster_fluid_communities}()},
\code{\link{cluster_infomap}()},
\code{\link{cluster_label_prop}()},
\code{\link{cluster_leading_eigen}()},
\code{\link{cluster_leiden}()},
\code{\link{cluster_louvain}()},
\code{\link{cluster_optimal}()},
\code{\link{cluster_spinglass}()},
\code{\link{cluster_walktrap}()},
\code{\link{compare}()},
\code{\link{make_clusters}()},
\code{\link{membership}()},
\code{\link{modularity.igraph}()},
\code{\link{plot_dendrogram}()},
\code{\link{split_join_distance}()},
\code{\link{voronoi_cells}()}
}
\concept{community}
|
