Maximum shortest path distance from a node to any other node.
For directed networks, centrality_ineccentricity and
centrality_outeccentricity use incoming and outgoing paths.
Usage
centrality_eccentricity(x, mode = "all", ...)
centrality_ineccentricity(x, ...)
centrality_outeccentricity(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.
