layout_centrality_group

layout_with_centrality_group

layout_igraph_centrality_group

arranges nodes in concentric circles according to a centrality index and keeping groups within a angle range

Several new layout algorithms to visualize networks are provided which are not part of 'igraph'.
Most are based on the concept of stress majorization by Gansner et al. (2004) <doi:10.1007/978-3-540-31843-9_25>.
Some more specific algorithms allow the user to emphasize hidden group structures in networks or focus on specific nodes.

David Schoch

graphlayouts

Additional Layout Algorithms for Network Visualizations

layout_centrality_group function

<dl><dt>g</dt>
<dd>igraph object</dd>
<dt>cent</dt>
<dd>centrality scores</dd>
<dt>group</dt>
<dd>vector indicating grouping of nodes</dd>
<dt>shrink</dt>
<dd>shrink the reserved angle range for a group to increase the gaps between groups</dd>
<dt>...</dt>
<dd>additional arguments to layout_with_centrality
The layout_igraph_* function should not be used directly. It is only used as an argument for plotting with 'igraph'.
'ggraph' natively supports the layout.</dd>
<dt>circular</dt>
<dd>not used</dd></dl>

Arguments

radial centrality group layout — layout_centrality_group

<dl>

<dt>g</dt>
<dd>igraph object</dd>


<dt>cent</dt>
<dd>centrality scores</dd>


<dt>group</dt>
<dd>vector indicating grouping of nodes</dd>


<dt>shrink</dt>
<dd>shrink the reserved angle range for a group to increase the gaps between groups</dd>


<dt>...</dt>
<dd>additional arguments to layout_with_centrality
The layout_igraph_* function should not be used directly. It is only used as an argument for plotting with 'igraph'.
'ggraph' natively supports the layout.</dd>


<dt>circular</dt>
<dd>not used</dd>

</dl>

layout_centrality_group: radial centrality group layout

Description

Usage

Value

Arguments

See Also

Examples