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.4.2 Depends: R (≥ 3.5.0) Imports: callr, digest, fs, magrittr, memoise, methods, osmdata, Rcpp (≥ 0.12.6), RcppParallel LinkingTo: Rcpp, RcppParallel, RcppThread Suggests: bench, dplyr, geodist (≥ 0.1.0), ggplot2, igraph, igraphdata, jsonlite, knitr, markdown, rmarkdown, sf, testthat (≥ 3.1.6), tidygraph Published: 2025-03-06 DOI: 10.32614/CRAN.package.dodgr Author: Mark Padgham [aut, cre], Andreas Petutschnig [aut], David Cooley [aut], Robin Lovelace [ctb], Andrew Smith [ctb], Malcolm Morgan [ctb], Andrea Gilardi [ctb], Shane Saunders [cph] (Original author of included code for priority heaps), Stanislaw Adaszewski [cph] (author of include concaveman-cpp code) Maintainer: Mark Padgham <mark.padgham at email.com> BugReports: https://github.com/UrbanAnalyst/dodgr/issues License: GPL-3 URL: https://github.com/UrbanAnalyst/dodgr, https://urbananalyst.github.io/dodgr/ NeedsCompilation: yes SystemRequirements: GNU make Citation: dodgr citation info Materials: README NEWS CRAN checks: dodgr results Documentation: Downloads: Reverse dependencies: Linking:Please use the canonical form https://CRAN.R-project.org/package=dodgr to link to this page.
RetroSearch is an open source project built by @garambo | Open a GitHub Issue
Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo
HTML:
3.2
| Encoding:
UTF-8
| Version:
0.7.4