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.1
Depends: R (≥ 3.2.0)
Imports: igraph, magrittr, methods, osmdata, rbenchmark, sp, Rcpp (≥ 0.12.6)
LinkingTo: Rcpp
Suggests: devtools, ggplot2, igraphdata, knitr, purrr, rmarkdown, roxygen2, scales, testthat
Published: 2017-09-28
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>
License: GPL-3
NeedsCompilation: yes
SystemRequirements: C++11
CRAN checks: dodgr results


Reference manual: dodgr.pdf
Vignettes: benchmark
Package source: dodgr_0.0.1.tar.gz
Windows binaries: r-devel:, r-release:, r-oldrel:
OS X El Capitan binaries: r-release: dodgr_0.0.1.tgz
OS X Mavericks binaries: r-oldrel: dodgr_0.0.1.tgz


Please use the canonical form to link to this page.