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.
|Depends:||R (≥ 2.10)|
|Imports:||dplyr, igraph, data.table, sf, units, rlang, methods, tidyselect, terra|
|Suggests:||testthat (≥ 2.1.0), knitr, rmarkdown, viridis, tmap, bench|
|Author:||Sarah Endicott [aut, cre], Kyle Lochhead [aut], Josie Hughes [aut], 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:||Sarah Endicott <sarah.endicott at ec.gc.ca>|
|License:||Apache License (≥ 2)|
|CRAN checks:||roads results|
|Windows binaries:||r-devel: roads_1.1.1.zip, r-release: roads_1.1.1.zip, r-oldrel: roads_1.1.1.zip|
|macOS binaries:||r-release (arm64): roads_1.1.1.tgz, r-oldrel (arm64): roads_1.1.1.tgz, r-release (x86_64): roads_1.1.1.tgz, r-oldrel (x86_64): roads_1.1.1.tgz|
|Old sources:||roads archive|
Please use the canonical form https://CRAN.R-project.org/package=roads to link to this page.