leading.eigenvector.community {igraph} | R Documentation |
Community structure detecting based on the leading eigenvector of the community matrix
Description
leading.eigenvector.community()
was renamed to cluster_leading_eigen()
to create a more
consistent API.
Usage
leading.eigenvector.community(
graph,
steps = -1,
weights = NULL,
start = NULL,
options = arpack_defaults(),
callback = NULL,
extra = NULL,
env = parent.frame()
)
Arguments
graph |
The input graph. Should be undirected as the method needs a symmetric matrix. |
steps |
The number of steps to take, this is actually the number of tries to make a step. It is not a particularly useful parameter. |
weights |
The weights of the edges. It must be a positive numeric vector,
|
start |
|
options |
A named list to override some ARPACK options. |
callback |
If not |
extra |
Additional argument to supply to the callback function. |
env |
The environment in which the callback function is evaluated. |