network_radius

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.

Provides tools for the analysis, visualization, and manipulation
of dynamical, social (Saqr et al. (2024) <doi:10.1007/978-3-031-54464-4_10>) and
complex networks (Saqr et al. (2025) <doi:10.1145/3706468.3706513>). The package
supports multiple network formats and offers flexible tools for heterogeneous,
multi-layer, and hierarchical network analysis with simple syntax and
extensive toolset.

Sonsoles López-Pernas

cograph

Analysis and Visualization of Complex Networks

Mohammed Saqr

network_radius function

<dl><dt>x</dt>
<dd>Network input: matrix, igraph, network, cograph_network, or tna object</dd>
<dt>directed</dt>
<dd>Logical or NULL. Consider edge direction? Default NULL,
which follows the directedness of the converted graph.</dd>
<dt>...</dt>
<dd>Currently unused; <code>directed</code> is already an explicit
argument above and <code>to_igraph</code> accepts no others.</dd></dl>

Arguments

Network Radius — network_radius

<dl>

<dt>x</dt>
<dd>Network input: matrix, igraph, network, cograph_network, or tna object</dd>


<dt>directed</dt>
<dd>Logical or NULL. Consider edge direction? Default NULL,
which follows the directedness of the converted graph.</dd>


<dt>...</dt>
<dd>Currently unused; <code>directed</code> is already an explicit
argument above and <code>to_igraph</code> accepts no others.</dd>

</dl>

network_radius: Network Radius

Description

Usage

Value

Arguments

Examples