Get community membership by modularity optimization
Through the use of greedy optimization of a modularity score, obtain the group membership values for each of the nodes in the graph. Note that this method only works on graphs without multiple edges.
get_cmty_fast_greedy(graph)
graph |
A graph object of class |
a data frame with group membership assignments for each of the nodes.
# Create a graph with a
# balanced tree
graph <-
create_graph() %>%
add_balanced_tree(
k = 2,
h = 2)
# Get the group membership
# values for all nodes in
# the graph through the greedy
# optimization of modularity
# algorithm
graph %>%
get_cmty_fast_greedy()
# 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
graph %>% get_node_df()Please choose more modern alternatives, such as Google Chrome or Mozilla Firefox.