Computes the radius of a network - the minimum eccentricity across all nodes. The eccentricity of a node is the maximum shortest path distance to any other node. The radius is the smallest such maximum distance.
Arguments
- x
Network input: matrix, igraph, network, cograph_network, or tna object
- directed
Logical. Consider edge direction? Default TRUE for directed graphs.
- ...
Additional arguments passed to
to_igraph
