centrality_kreach: Geodesic K-Path Centrality

In cograph: Analysis and Visualization of Complex Networks

Geodesic K-Path Centrality

Description

Count of nodes reachable within shortest path distance k. Measures how many nodes a given node can reach quickly.

Usage

centrality_kreach(x, mode = "all", k = 3, ...)

Arguments

x	Network input (matrix, igraph, network, cograph_network, tna object).
mode	For directed networks: "all" (default), "in", or "out".
k	Maximum path length. Default 3.
...	Additional arguments passed to centrality (e.g., weighted, directed, invert_weights).

Value

Named numeric vector of k-reach centrality values.

See Also

centrality for computing multiple measures at once.

Examples

adj <- matrix(c(0, 1, 0, 0, 1, 0, 1, 0, 0, 1, 0, 1, 0, 0, 1, 0), 4, 4)
rownames(adj) <- colnames(adj) <- c("A", "B", "C", "D")
centrality_kreach(adj, k = 2)

cograph documentation built on April 1, 2026, 1:07 a.m.