DiagrammeR (version 0.9.2)

get_cmty_fast_greedy: Get community membership by modularity optimization

Description

Through the use of greedy optimization of a modularity score, obtain the group membership values for each of the nodes in the graph.

Usage

get_cmty_fast_greedy(graph)

Arguments

graph

a graph object of class dgr_graph.

Value

a data frame with group membership assignments for each of the nodes.

Examples

# NOT RUN {
# Create a random graph
graph <-
  create_random_graph(
    n = 10, m = 22,
    set_seed = 23)

# Get the group membership values for all
# nodes in the graph through the greedy
# optimization of modularity algorithm
get_cmty_fast_greedy(graph)
#>    id f_g_group
#> 1   1         1
#> 2   2         2
#> 3   3         2
#> 4   4         1
#> 5   5         1
#> 6   6         1
#> 7   7         2
#> 8   8         1
#> 9   9         2
#> 10 10         1

# Add the group membership values to the
# graph as a node attribute
graph <-
  graph %>%
  join_node_attrs(
    df = get_cmty_fast_greedy(.))

# Display the graph's node data frame
get_node_df(graph)
#>    id type label value f_g_group
#> 1   1 <NA>     1   6.0         1
#> 2   2 <NA>     2   2.5         2
#> 3   3 <NA>     3   3.5         2
#> 4   4 <NA>     4   7.5         1
#> 5   5 <NA>     5   8.5         1
#> 6   6 <NA>     6   4.5         1
#> 7   7 <NA>     7  10.0         2
#> 8   8 <NA>     8  10.0         1
#> 9   9 <NA>     9   8.5         2
#> 10 10 <NA>    10  10.0         1
# }