# Buildsheet autogenerated by ravenadm tool -- Do not edit.

NAMEBASE=		R-graphlayouts
VERSION=		1.2.2
KEYWORDS=		cran
VARIANTS=		std
SDESC[std]=		Layout algorithms for network visualization
HOMEPAGE=		https://github.com/schochastics/graphlayouts
CONTACT=		CRAN_Automaton[cran@ironwolf.systems]

DOWNLOAD_GROUPS=	main
SITES[main]=		CRAN/src/contrib
			https://loki.dragonflybsd.org/cranfiles/
DISTFILE[1]=		graphlayouts_1.2.2.tar.gz:main
DIST_SUBDIR=		CRAN
DF_INDEX=		1
SPKGS[std]=		single

OPTIONS_AVAILABLE=	none
OPTIONS_STANDARD=	none

BUILDRUN_DEPENDS=	R-igraph:single:std
			R-Rcpp:single:std
			R-RcppArmadillo:single:std

USES=			cran gmake

DISTNAME=		graphlayouts

GENERATED=		yes

INSTALL_REQ_TOOLCHAIN=	yes

[FILE:485:descriptions/desc.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) &lt;<a
href="https://doi.org/10.1007%2F978-3-540-31843-9_25"
target="_top">doi:10.1007/978-3-540-31843-9_25</a>&gt;. Some more specific
algorithms allow the user to emphasize hidden group structures in networks
or focus on specific nodes.


[FILE:109:distinfo]
4848f108fe53ba898217ccf24328d626d75620f97020a467f07b7f69afc1e82f      2203358 CRAN/graphlayouts_1.2.2.tar.gz