graphlayouts
Additional Layout Algorithms for Network Visualizations
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.
Versions across snapshots
| Version | Repository | File | Size |
|---|---|---|---|
1.2.3 |
rolling linux/jammy R-4.5 | graphlayouts_1.2.3.tar.gz |
2.3 MiB |
1.2.3 |
rolling linux/noble R-4.5 | graphlayouts_1.2.3.tar.gz |
2.3 MiB |
1.2.3 |
rolling source/ R- | graphlayouts_1.2.3.tar.gz |
2.1 MiB |
1.2.3 |
latest linux/jammy R-4.5 | graphlayouts_1.2.3.tar.gz |
2.3 MiB |
1.2.3 |
latest linux/noble R-4.5 | graphlayouts_1.2.3.tar.gz |
2.3 MiB |
1.2.3 |
latest source/ R- | graphlayouts_1.2.3.tar.gz |
2.1 MiB |
1.2.3 |
2026-04-26 source/ R- | graphlayouts_1.2.3.tar.gz |
2.1 MiB |
1.2.3 |
2026-04-23 source/ R- | graphlayouts_1.2.3.tar.gz |
2.1 MiB |
1.2.3 |
2026-04-09 windows/windows R-4.5 | graphlayouts_1.2.3.zip |
2.6 MiB |
1.2.2 |
2025-04-20 source/ R- | graphlayouts_1.2.2.tar.gz |
2.1 MiB |