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.

Version: 1.1.1
Depends: R (≥ 3.2.0)
Imports: igraph, Rcpp
LinkingTo: Rcpp, RcppArmadillo
Suggests: oaqc, testthat, ggraph, ggplot2, knitr, rmarkdown, uwot
Published: 2024-03-09
DOI: 10.32614/CRAN.package.graphlayouts
Author: David Schoch ORCID iD [aut, cre]
Maintainer: David Schoch <david at>
License: MIT + file LICENSE
NeedsCompilation: yes
Citation: graphlayouts citation info
Materials: README NEWS
CRAN checks: graphlayouts results


Reference manual: graphlayouts.pdf
Vignettes: graphlayouts


Package source: graphlayouts_1.1.1.tar.gz
Windows binaries: r-devel:, r-release:, r-oldrel:
macOS binaries: r-release (arm64): graphlayouts_1.1.1.tgz, r-oldrel (arm64): graphlayouts_1.1.1.tgz, r-release (x86_64): graphlayouts_1.1.1.tgz, r-oldrel (x86_64): graphlayouts_1.1.1.tgz
Old sources: graphlayouts archive

Reverse dependencies:

Reverse imports: CBNplot, ggraph, roughnet, snahelper
Reverse suggests: deepdep, manynet


Please use the canonical form to link to this page.