Package: dodgr
Title: Distances on Directed Graphs
Version: 0.2.17
Authors@R: c(
    person("Mark", "Padgham", , "mark.padgham@email.com", role = c("aut", "cre")),
    person("Andreas", "Petutschnig", role = "aut"),
    person("David", "Cooley", role = "aut"),
    person("Robin", "Lovelace", role = "ctb"),
    person("Andrew", "Smith", role = "ctb"),
    person("Malcolm", "Morgan", role = "ctb"),
    person("Shane", "Saunders", role = "cph",
           comment = "Original author of included code for priority heaps")
  )
Description: 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.
License: GPL-3
URL: https://github.com/ATFutures/dodgr
BugReports: https://github.com/ATFutures/dodgr/issues
Depends: R (>= 3.5.0)
Imports: callr, digest, fs, magrittr, methods, osmdata, Rcpp (>=
        0.12.6), RcppParallel
Suggests: bench, dplyr, geodist, ggplot2, igraph, igraphdata, jsonlite,
        knitr, markdown, rmarkdown, roxygen2, sf, testthat, tidygraph
LinkingTo: Rcpp, RcppParallel, RcppThread
VignetteBuilder: knitr
Encoding: UTF-8
LazyData: true
NeedsCompilation: yes
RoxygenNote: 7.2.1
SystemRequirements: C++11, GNU make
Packaged: 2022-11-04 08:13:59 UTC; smexus
Author: Mark Padgham [aut, cre],
  Andreas Petutschnig [aut],
  David Cooley [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@email.com>
Repository: CRAN
Date/Publication: 2022-11-04 17:40:06 UTC
