spaths: Shortest Paths Between Points in Grids

Shortest paths between points in grids. Optional barriers and custom transition functions. Applications regarding planet Earth, as well as generally spheres and planes. Optimized for computational performance, customizability, and user friendliness. Graph-theoretical implementation tailored to gridded data. Currently focused on Dijkstra's (1959) <doi:10.1007/BF01386390> algorithm. Future updates broaden the scope to other least cost path algorithms and to centrality measures.

Version:	1.1.2
Imports:	base (≥ 4.0.0), Rcpp (≥ 1.0.9), data.table, parallel, stats, utils
LinkingTo:	Rcpp
Suggests:	terra, knitr, rmarkdown, testthat (≥ 3.0.0)
Published:	2024-05-30
DOI:	10.32614/CRAN.package.spaths
Author:	Christian Düben [aut, cre]
Maintainer:	Christian Düben <cdueben.ml+cran at proton.me>
BugReports:	https://github.com/ChristianDueben/spaths/issues
License:	MIT + file LICENSE
URL:	https://github.com/ChristianDueben/spaths
NeedsCompilation:	yes
Materials:	README NEWS
In views:	Spatial
CRAN checks:	spaths results

Documentation:

Reference manual:	spaths.pdf
Vignettes:	Introduction to spaths

Downloads:

Package source:	spaths_1.1.2.tar.gz
Windows binaries:	r-devel: spaths_1.1.2.zip, r-release: spaths_1.1.2.zip, r-oldrel: spaths_1.1.2.zip
macOS binaries:	r-release (arm64): not available, r-oldrel (arm64): not available, r-release (x86_64): not available, r-oldrel (x86_64): not available
Old sources:	spaths archive

Linking:

Please use the canonical form https://CRAN.R-project.org/package=spaths to link to this page.