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.
Versions across snapshots
| Version | Repository | File | Size |
|---|---|---|---|
1.2.0 |
rolling linux/jammy R-4.5 | spaths_1.2.0.tar.gz |
649.9 KiB |
1.2.0 |
rolling linux/noble R-4.5 | spaths_1.2.0.tar.gz |
672.8 KiB |
1.2.0 |
rolling source/ R- | spaths_1.2.0.tar.gz |
241.6 KiB |
1.2.0 |
latest linux/jammy R-4.5 | spaths_1.2.0.tar.gz |
649.9 KiB |
1.2.0 |
latest linux/noble R-4.5 | spaths_1.2.0.tar.gz |
672.8 KiB |
1.2.0 |
latest source/ R- | spaths_1.2.0.tar.gz |
241.6 KiB |
1.2.0 |
2026-04-26 source/ R- | spaths_1.2.0.tar.gz |
241.6 KiB |
1.2.0 |
2026-04-23 source/ R- | spaths_1.2.0.tar.gz |
241.6 KiB |
1.2.0 |
2026-04-09 windows/windows R-4.5 | spaths_1.2.0.zip |
1.0 MiB |
1.2.0 |
2025-04-20 source/ R- | spaths_1.2.0.tar.gz |
241.6 KiB |