dodgr: Distances on Directed Graphs

Distances on dual-weighted directed graphs using priority-queue shortest paths. 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.0.3
Depends: R (≥ 3.2.0)
Imports: igraph, magrittr, methods, osmdata, rbenchmark, sp, Rcpp (≥ 0.12.6)
LinkingTo: Rcpp
Suggests: devtools, ggplot2, igraphdata, knitr, purrr, RColorBrewer, rmarkdown, roxygen2, scales, testthat
Published: 2017-10-30
Author: Mark Padgham [aut, cre], Andreas Peutschnig [aut], Shane Saunders [cph] (Original author of included code for priority heaps)
Maintainer: Mark Padgham <mark.padgham at email.com>
BugReports: https://github.com/gmost/dodgr/issues
License: GPL-3
URL: https://github.com/gmost/dodgr
NeedsCompilation: yes
SystemRequirements: C++11
Materials: NEWS
CRAN checks: dodgr results

Downloads:

Reference manual: dodgr.pdf
Vignettes: 2 benchmark
1 dodgr
Package source: dodgr_0.0.3.tar.gz
Windows binaries: r-devel: dodgr_0.0.3.zip, r-release: dodgr_0.0.3.zip, r-oldrel: dodgr_0.0.3.zip
OS X El Capitan binaries: r-release: dodgr_0.0.3.tgz
OS X Mavericks binaries: r-oldrel: dodgr_0.0.3.tgz
Old sources: dodgr archive

Linking:

Please use the canonical form https://CRAN.R-project.org/package=dodgr to link to this page.