Centralize a graph according to the betweenness of vertices — centralization.betweenness • igraph

centralization.betweenness() was renamed to centr_betw() to create a more consistent API.

Usage

centralization.betweenness(graph, directed = TRUE, normalized = TRUE)

Arguments

graph: The input graph.
directed: logical scalar, whether to use directed shortest paths for calculating betweenness.
normalized: Logical scalar. Whether to normalize the graph level centrality score by dividing by the theoretical maximum.

centralization_betweenness()