cograph (version 2.0.0)

centrality_eccentricity: Eccentricity

Description

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, ...)

Value

Named numeric vector of eccentricity values.

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.

Examples

adj <- matrix(c(0, 1, 0, 1, 0, 1, 0, 1, 0), 3, 3)
rownames(adj) <- colnames(adj) <- c("A", "B", "C")
centrality_eccentricity(adj)