Package: spaths 1.1.3
Christian Düben
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.
Authors:
spaths_1.1.3.tar.gz
spaths_1.1.3.tar.gz(r-4.5-noble)spaths_1.1.3.tar.gz(r-4.4-noble)
spaths_1.1.3.tgz(r-4.4-emscripten)spaths_1.1.3.tgz(r-4.3-emscripten)
spaths.pdf |spaths.html✨
spaths/json (API)
NEWS
# Install 'spaths' in R: |
install.packages('spaths', repos = c('https://cran.r-universe.dev', 'https://cloud.r-project.org')) |
Bug tracker:https://github.com/cdueben/spaths/issues
Last updated 5 months agofrom:ae213684fd. Checks:OK: 1 NOTE: 1. Indexed: no.
Target | Result | Date |
---|---|---|
Doc / Vignettes | OK | Nov 09 2024 |
R-4.5-linux-x86_64 | NOTE | Nov 09 2024 |
Exports:rnd_locationsshortest_paths
Dependencies:data.tableRcpp
Readme and manuals
Help Manual
Help page | Topics |
---|---|
Random location drawing | rnd_locations |
Shortest Paths and/ or Distances between Locations | shortest_paths |