Nothing
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.
Getting started
Browse package contents
Package details |
|
|---|---|
| Author | Christian Düben [aut, cre] |
| Maintainer | Christian Düben <cdueben.ml+cran@proton.me> |
| License | MIT + file LICENSE |
| Version | 1.2.0 |
| URL | https://github.com/cdueben/spaths |
| Package repository | View on CRAN |
| Installation |
Install the latest version of this package by entering the following in R:
|
Try the spaths package in your browser
Any scripts or data that you put into this service are public.
