Skip to content

spaths

1.2.0

Shortest Paths Between Points in Grids

0packages depend
3.1Kdownloads / year
test coverage
8/13checks pass

Overview

About
Maintained by Christian DübenFirst published 2024-04-095 releasesCRAN page ↗GitHub ↗

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.

Install

Health

CRAN checks
3ERROR2NOTE8OK
Failing flavors
  • NOTE r-devel-linux-x86_64-fedora-clang
  • NOTE r-devel-linux-x86_64-fedora-gcc
  • ERROR r-oldrel-macos-arm64
  • ERROR r-oldrel-macos-x86_64
  • ERROR r-release-macos-x86_64
Slowest check: 6.4 min · r-oldrel-windows-x86_64
Code health
Yes
Tests · ratio 0.21
not tracked
Coverage
100%
Documentation · exports
6
Dependencies · direct
Check history
  • ERROR2026-03-10
    8 OK · 2 NOTE · 0 WARNING · 4 ERROR · 0 FAILURE

Documentation

Documentation
READMEYes · 108 wordsVignettesYes · dynamicpkgdown siteNoNEWSYes · 100% structuredCode of conductNoContributing guideNo
Examples that run
67%
Documented parameters
100%
Return-value docs
100%
References docs
33%

Downloads

3.1K
CRAN downloads in the past year
Rank #16,272 · ~9/day · ~261/mo
Daily download trend is not available in this view yet.
17030 days
65590 days
3.1K1 year
Compare downloads with other packages →
Also on399 r2u1 autocran

Repository

Repository
4Stars
0Forks
0Open issues
0Open PRs
0Releases
36Commits
3Contributors
36 commits · Last activity 2025-04-03

Stars over time

2024-11-15 · 42026-07-07 · 4

Repository practices

Upstream repositoryBeta

1 development-tooling and community-health practice detected across 1 family in the upstream repository

Checks run against github.com/cdueben/spaths on 2026-08-09.

Lint, format, editor (1)
RStudio project
How this is detected·Detection ruleset v1 (2026-07-18)

Dependencies

Declared dependencies
8 external dependencies (excludes base and recommended)
Depends (0)
none
Imports (6)
baseRcppdata.tableparallelstatsutils
LinkingTo (1)
Enhances (0)
none
Reverse dependencies
0direct
0indirect

Nothing depends on this yet.

Code & Tests

People & History

People (1)
Maintainer (1)
Author, Maintainer
Authors (1)
Author, Maintainer
Package Timeline

5 releases. Pick two to compare their code metrics. R releases are shown for context.

  • R
    R 4.6.0 released · 2026-04-24
  • R
    R 4.5.0 released · 2025-04-11
  • 1.2.0Latest
    2025-04-04 · current release · diff ↗
  • 1.1.3
    2024-07-11 · diff ↗
  • 1.1.2
    2024-05-31 · diff ↗
  • 1.1.1
    2024-05-25 · diff ↗
  • R
    R 4.4.0 released · 2024-04-24
  • 1.1.0
    2024-04-09
  • R
    R 4.3.0 released · 2023-04-21

Package metadata

First published
2024-04-09
Total releases
5 / 2 yrs
License
MIT + file LICENSE OSI
Download size
243 KB
Installed size
not tracked yet
With dependencies
not tracked yet
Appears in task views

Cite

Cite this package

Run in R for the authors' preferred citation:

citation("spaths")
Düben, C. (2025). spaths: Shortest Paths Between Points in Grids (Version 1.2.0) [Computer software]. https://doi.org/10.32614/CRAN.package.spaths

This is what citation() produces when a package has no citation file of its own. If it prints something else, use that.

Cite the R Observatory

For a number measured here: a download total, a coverage figure, an archival date.

APA

Balamuta, J. J. (2026). R Observatory: Metrics for spaths version 1.2.0 [Data set]. HJJB, LLC. Data release v2026-08-11. https://doi.org/10.5281/zenodo.21843040

From data release v2026-08-11, which the citation names so these numbers can be found later. More on citing and the projects behind them.

Report a problem with this page →

Privacy choices

These apply to this browser and are stored on this device only. Nothing about your choice is sent to us.

Read the privacy policy