roads: Road Network Projection

Project road network development based on an existing road network, target locations to be connected by roads and a cost surface. Road projection methods include minimum spanning tree with least cost path (Kruskal’s algorithm (1956) <doi:10.2307/2033241>), least cost path (Dijkstra's algorithm (1959) <doi:10.1007/BF01386390>) or snapping. These road network projection methods are ideal for use with land cover change projection models.

Version: 1.0.0
Depends: R (≥ 2.10)
Imports: raster, dplyr, igraph, sp, data.table,, sf, stars, units, rlang, methods, tidyselect
Suggests: testthat (≥ 2.1.0), knitr, rmarkdown, viridis
Published: 2022-06-22
Author: Sarah Endicott ORCID iD [aut], Kyle Lochhead [aut], Josie Hughes [aut, cre], Patrick Kirby [aut], Her Majesty the Queen in Right of Canada as represented by the Minister of the Environment [cph] (Copyright holder for included functions buildSimList, getLandingsFromTarget, pathsToLines, plotRoads, projectRoads, rasterizeLine, rasterToLineSegments), Province of British Columbia [cph] (Copyright holder for included functions getGraph, lcpList, mstList, shortestPaths, getClosestRoad, buildSnapRoads)
Maintainer: Josie Hughes < at>
License: Apache License (≥ 2)
NeedsCompilation: no
Materials: README NEWS
CRAN checks: roads results


Reference manual: roads.pdf
Vignettes: roads Package


Package source: roads_1.0.0.tar.gz
Windows binaries: r-devel:, r-release:, r-oldrel:
macOS binaries: r-release (arm64): roads_1.0.0.tgz, r-oldrel (arm64): roads_1.0.0.tgz, r-release (x86_64): roads_1.0.0.tgz, r-oldrel (x86_64): roads_1.0.0.tgz


Please use the canonical form to link to this page.