Port variant | std |
Summary | Layout algorithms for network visualization |
BROKEN | |
Package version | 1.2.1 |
Homepage | https://github.com/schochastics/graphlayouts |
Keywords | cran |
Maintainer | CRAN Automaton |
License | Not yet specified |
Other variants | There are no other variants. |
Ravenports | Buildsheet | History |
Ravensource | Port Directory | History |
Last modified | 22 NOV 2024, 12:26:16 UTC |
Port created | 15 APR 2020, 07:13:19 UTC |
single | 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. |
Build (only) |
gmake:primary:std R:primary:std icu:dev:std |
Build and Runtime |
R-igraph:single:std R-Rcpp:single:std R-RcppArmadillo:single:std |
Runtime (only) |
R:primary:std R:nls:std |
main | mirror://CRAN/src/contrib https://loki.dragonflybsd.org/cranfiles/ |
R-ggraph:std | Grammar of Graphics implementation |