walktrap.community(graph, weights = E(graph)$weight, steps = 4, merges = TRUE, modularity = FALSE, labels = TRUE)
TRUEand the graph has a vertex attribute called
namethen it will be included in the result, in the list member called
namevertex attribute will be copied here, if exists. }
edge.betweenness.communityfor other community detection methods.