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 to emphasize hidden group structures in networks or focus on specific nodes.
[email protected] is safe to use (health: 62/100)
Get this data programmatically — free, no authentication.
curl https://depscope.dev/api/check/conda/r-graphlayoutsFirst published · 2020-10-26 18:38:06.665000+00:00
Last updated · 2026-02-21 11:04:47.490000+00:00