Package: dodgr
Title: Distances on Directed Graphs
Version: 0.2.7
Authors@R: c(
    person("Mark", "Padgham", email="mark.padgham@email.com", role=c("aut", "cre")),
    person("Andreas", "Petutschnig", 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.
Depends: R (>= 3.5.0)
License: GPL-3
Imports: callr, digest, magrittr, methods, osmdata, Rcpp (>= 0.12.6),
        RcppParallel, RcppThread
Suggests: dplyr, geodist, ggplot2, igraph, igraphdata, jsonlite, knitr,
        purrr, rbenchmark, RColorBrewer, rmarkdown, roxygen2, scales,
        sf, testthat, tidygraph
LinkingTo: Rcpp, RcppParallel, RcppThread
SystemRequirements: C++11, GNU make
VignetteBuilder: knitr
NeedsCompilation: yes
Encoding: UTF-8
LazyData: true
URL: https://github.com/ATFutures/dodgr
BugReports: https://github.com/ATFutures/dodgr/issues
RoxygenNote: 7.1.0
Packaged: 2020-05-05 09:26:33 UTC; smexus
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@email.com>
Repository: CRAN
Date/Publication: 2020-05-05 22:20:02 UTC
Built: R 4.1.0; x86_64-w64-mingw32; 2020-08-03 11:23:38 UTC; windows
Archs: i386, x64
