layout_umap

layout_with_umap

layout_igraph_umap

Using the UMAP dimensionality reduction algorithm as a graph layout

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_umap function

<dl><dt>g</dt>
<dd>igraph object</dd>
<dt>pivots</dt>
<dd>if not NULL, number of pivot nodes to use for distance calculation (for large graphs).</dd>
<dt>...</dt>
<dd>additional parameters for umap. See the <code>?uwot::umap</code> for help.</dd>
<dt>circular</dt>
<dd>not used</dd></dl>

Arguments

Author

UMAP graph layouts — layout_umap

<dl>

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


<dt>pivots</dt>
<dd>if not NULL, number of pivot nodes to use for distance calculation (for large graphs).</dd>


<dt>...</dt>
<dd>additional parameters for umap. See the <code>?uwot::umap</code> for help.</dd>


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

</dl>

layout_umap: UMAP graph layouts

Description

Usage

Value

Arguments

Author

Details

References

Examples