Inverse of the average shortest path distance from a node to all others.
For directed networks, centrality_incloseness and
centrality_outcloseness measure incoming and outgoing closeness.
Usage
centrality_closeness(x, mode = "all", ...)
centrality_incloseness(x, ...)
centrality_outcloseness(x, ...)Arguments
- x
Network input (matrix, igraph, network, cograph_network, tna object).
- mode
For directed networks:
"all"(default),"in", or"out".- ...
Additional arguments passed to
centrality(e.g.,normalized,weighted,directed).
See also
centrality for computing multiple measures at once,
centrality_harmonic for a variant that handles disconnected
graphs.
