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.
- Version1.1.3
- R versionunknown
- LicenseMIT
- LicenseLICENSE
- Needs compilation?Yes
- Last release07/11/2024
Documentation
Team
Christian Düben
MaintainerShow author details
Insights
Last 30 days
This package has been downloaded 319 times in the last 30 days. Now we're getting somewhere! Enough downloads to populate a lively group chat. The following heatmap shows the distribution of downloads per day. Yesterday, it was downloaded 8 times.
The following line graph shows the downloads per day. You can hover over the graph to see the exact number of downloads per day.
Last 365 days
This package has been downloaded 3,833 times in the last 365 days. Consider this 'mid-tier influencer' status—if it were a TikTok, it would get a nod from nieces and nephews. The day with the most downloads was Jun 01, 2024 with 54 downloads.
The following line graph shows the downloads per day. You can hover over the graph to see the exact number of downloads per day.
Data provided by CRAN
Binaries
Dependencies
- Imports2 packages
- Suggests4 packages
- Linking To1 package