centralization.betweenness.tmax: Theoretical maximum for betweenness centralization
In igraph/rigraph: Network Analysis and Visualization
View source: R/centralization.R
centralization.betweenness.tmax R Documentation
Theoretical maximum for betweenness centralization
Description
![[Deprecated]](../help/figures/lifecycle-deprecated.svg)
centralization.betweenness.tmax() was renamed to centr_betw_tmax() to create a more
consistent API.
Usage
centralization.betweenness.tmax(graph = NULL, nodes = 0, directed = TRUE)
Arguments
graph
The input graph. It can also be NULL, if
nodes is given.
nodes
The number of vertices. This is ignored if the graph is
given.
directed
logical scalar, whether to use directed shortest paths
for calculating betweenness.
igraph/rigraph documentation built on May 19, 2024, 6:19 a.m.
R Package Documentation
Browse R Packages
We want your feedback!
Note that we can't provide technical support on individual packages. You should contact the package authors for that.
View source: R/centralization.R
| centralization.betweenness.tmax | R Documentation |
Theoretical maximum for betweenness centralization
Description
centralization.betweenness.tmax() was renamed to centr_betw_tmax() to create a more
consistent API.
Usage
centralization.betweenness.tmax(graph = NULL, nodes = 0, directed = TRUE)
Arguments
graph |
The input graph. It can also be |
nodes |
The number of vertices. This is ignored if the graph is given. |
directed |
logical scalar, whether to use directed shortest paths for calculating betweenness. |
R Package Documentation
Browse R Packages
We want your feedback!
Note that we can't provide technical support on individual packages. You should contact the package authors for that.
Embedding an R snippet on your website
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.