Betweenness centrality in a weighted network
This function calculates betweenness scores for nodes in a weighted network based on the distance_w-function.
Note: This algorithm relies on the igraphs package's implementation of Dijkstra's algorithm. Currently, it does not find multiple shortest paths if two exist.
A weighted edgelist
logical, whether the network is directed or undirected. Default is NULL, this means that the function checks whether the edgelist is directed or not.
sets the alpha parameter in the generalised measures from Opsahl, T., Agneessens, F., Skvoretz, J., 2010. Node Centrality in Weighted Networks: Generalizing Degree and Shortest Paths. Social Networks. If this parameter is set to 1 (default), the Dijkstra shortest paths are used. The length of these paths rely simply on the tie weights and disregards the number of nodes on the paths.
Returns a data.frame with two columns: the first column contains the nodes' ids, and the second column contains the nodes' betweenness scores.
version 1.0.0, taken, with permission, from package tnet
Tore Opsahl; http://toreopsahl.com
1 2 3 4 5 6 7 8 9 10 11 12 13
Want to suggest features or report bugs for rdrr.io? Use the GitHub issue tracker.