spaths: Shortest Paths Between Points in Grids (original) (raw)
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.2.0 |
|---|---|
| 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: | 2025-04-04 |
| 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/cdueben/spaths/issues |
| License: | MIT + file |
| URL: | https://github.com/cdueben/spaths |
| NeedsCompilation: | yes |
| Materials: | README, NEWS |
| In views: | Spatial |
| CRAN checks: | spaths results |
Documentation:
Downloads:
Linking:
Please use the canonical formhttps://CRAN.R-project.org/package=spathsto link to this page.