Distances on dual-weighted directed graphs using priority-queue shortest paths (Padgham (2019) <doi:10.32866/6945>). Weighted directed graphs have weights from A to B which may differ from those from B to A. Dual-weighted directed graphs have two sets of such weights. A canonical example is a street network to be used for routing in which routes are calculated by weighting distances according to the type of way and mode of transport, yet lengths of routes must be calculated from direct distances.
| Version: | 0.2.7 |
| Depends: | R (≥ 3.5.0) |
| Imports: | callr, digest, magrittr, methods, osmdata, Rcpp (≥ 0.12.6), RcppParallel, RcppThread |
| LinkingTo: | Rcpp, RcppParallel, RcppThread |
| Suggests: | dplyr, geodist, ggplot2, igraph, igraphdata, jsonlite, knitr, purrr, rbenchmark, RColorBrewer, rmarkdown, roxygen2, scales, sf, testthat, tidygraph |
| Published: | 2020-05-05 |
| Author: | Mark Padgham [aut, cre], Andreas Petutschnig [aut], Robin Lovelace [ctb], Andrew Smith [ctb], Malcolm Morgan [ctb], Shane Saunders [cph] (Original author of included code for priority heaps) |
| Maintainer: | Mark Padgham <mark.padgham at email.com> |
| BugReports: | https://github.com/ATFutures/dodgr/issues |
| License: | GPL-3 |
| URL: | https://github.com/ATFutures/dodgr |
| NeedsCompilation: | yes |
| SystemRequirements: | C++11, GNU make |
| Citation: | dodgr citation info |
| Materials: | README NEWS |
| CRAN checks: | dodgr results |
| Reference manual: | dodgr.pdf |
| Vignettes: |
1 dodgr 3 dodgr-flows 4 dodgr-iso 2 dodgr_times |
| Package source: | dodgr_0.2.7.tar.gz |
| Windows binaries: | r-devel: dodgr_0.2.7.zip, r-release: dodgr_0.2.7.zip, r-oldrel: dodgr_0.2.7.zip |
| macOS binaries: | r-release: dodgr_0.2.7.tgz, r-oldrel: dodgr_0.2.7.tgz |
| Old sources: | dodgr archive |
| Reverse suggests: | stplanr |
Please use the canonical form https://CRAN.R-project.org/package=dodgr to link to this page.