Fraction of all shortest paths passing through a node, similar to betweenness but weighting paths by 1/count (Goh et al. 2001).
Arguments
- x
Network input (matrix, igraph, network, cograph_network, tna object).
- ...
Additional arguments passed to
centrality(e.g.,weighted,directed).
See also
centrality for computing multiple measures at once,
centrality_betweenness for the standard variant.
