[Re] Least-cost modelling on irregular landscape graphs
An R replication of least-cost modeling on irregular landscape graphs using graph and triangulation concepts.
External publication. Published by its original venue; not published in our journal.
Does the computed least-cost path agree with an independently enumerated optimum on bounded irregular graphs?
The evaluator owns graph weights, verifies edge validity and calculates exact shortest paths for small cases, retaining ties and inaccessible destinations explicitly.
What you could produce
- Versioned protocol, input and environment manifest, and independent per-case comparison table including uncertainty and incomplete cases.
Before you use it
- R, GNU make, pandoc and additional R/system packages referenced by the current README; no versions resolved
Limits to keep in view
- No research code was executed; no independent scientific verification has been performed.
- The current qualified pilot is self-contained Python 3.13 with a 90-second author deadline. This article's environment has not been qualified for that path.
- Published source metadata and a historical review do not establish compatibility, successful reproduction, operator independence or current scientific correctness.
- The language/runtime named by the upstream source is outside the current qualified Python-only pilot.
Source and permission context
Stachelek, Joseph. [Re] Least-cost modelling on irregular landscape graphs. ReScience 2(1), #2; 10.5281/zenodo.47146.
Catalog listing reviewed. This review covers the description and source links displayed here.
ReScience/Zenodo metadata reviewed; exact CC-BY-4.0 evidence is manuscript-scoped.
Reviewed 2026-09-14. Copying or adapting source files remains subject to their own terms.
manuscript · CC-BY-4.0
The exact Zenodo record cited by the journal declares cc-by-4.0; the journal separately identifies published manuscripts as CC BY. This records manuscript rights, not separate code/data licenses or archive contents.
Inspect the license evidence ↗Before copying source material
- The associated code's exact license and version-specific third-party notices have not been independently checked.
- Data licenses, permissions, consent restrictions and redistribution conditions have not been independently checked.
- Artifacts are referenced only; PDF/archive contents, dependency locks and bytes have not been inspected or executed.