Shortest Paths Between Points in Grids R package spaths version 1.2.0 CRAN Task View: Spatial (https://CRAN.R-project.org/view=Spatial) 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. Software Imports: base (>= 4.0.0), Rcpp (>= 1.0.9), data.table, parallel, stats, utils LinkingTo: Rcpp Suggests: terra, knitr, rmarkdown, testthat (>= 3.0.0) Christian Düben <cdueben.ml+cran@proton.me> Comprehensive R Archive Network (CRAN) Christian Düben [aut, cre] MIT + file LICENSE (https://CRAN.R-project.org/package=spaths/LICENSE) 2025-04-04 application/tgz https://CRAN.R-project.org/package=spaths doi:10.32614/CRAN.package.spaths