This function calculates betweenness scores for a weighted network based on the distance_w. NB: This algorithm relies on the RBGL package's boost-library. Currently the sp.between funtion in the boost library only finds one shortest path, even if multiple exists. Therefore, this function should be used with caution and not for publishing.
Usage
betweenness_w(edgelist, directed=NULL)
Arguments
edgelist
A weighted edgelist
directed
logical, whether the network is directed or undirected. Default is NULL, this means that the function checks whether the edgelist is directed or not.
Value
Returns betweenness score for each vertex in the edgelist.