R: Finds the optimal partition using the Leiden algorithm

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 = 2L)

### 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. Refer to igraph, weighted graphs.
`resolution` | Integer resoluiton 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.0.2 Index]