find_partition {leidenAlg} | R Documentation |
Finds the optimal partition using the Leiden algorithm
Description
Finds the optimal partition using the Leiden algorithm
Usage
find_partition(graph, edge_weights, resolution = 1, niter = 2)
Arguments
graph |
The igraph graph to define the partition on |
edge_weights |
Vector of edge weights. In weighted graphs, a real number is assigned to each (directed or undirected) edge. For an unweighted graph, this is set to 1. Refer to igraph, weighted graphs. |
resolution |
Numeric scalar, resolution parameter controlling communities detected (default=1.0) Higher resolutions lead to more communities, while lower resolutions lead to fewer communities. |
niter |
Number of iterations that the algorithm should be run for (default=2) |
Value
A vector of membership values
Examples
library(igraph)
library(leidenAlg)
g <- make_star(10)
E(g)$weight <- seq(ecount(g))
find_partition(g, E(g)$weight)
[Package leidenAlg version 1.1.3 Index]