Computes the radius of a network, the minimum eccentricity across all nodes. The eccentricity of a node is its largest shortest-path distance to any other node. Edge weights are used as distances, and directed networks use outgoing paths.
Arguments
- x
Network input: matrix, igraph, network, cograph_network, or tna object
- directed
Logical or NULL. Consider edge direction? Default NULL, which follows the directedness of the converted graph.
- ...
Passed to
to_igraph, which accepts no arguments besidesdirected; anything else raises an "unused argument" error.