DESCRIPTION

Package: dodgr
Title: Distances on Directed Graphs
Version: 0.4.1.037
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("Andrea", "Gilardi", role="ctb", comment = c(ORCID = "0000-0002-9424-7439")),
    person("Shane", "Saunders", role = "cph",
           comment = "Original author of included code for priority heaps"),
    person("Stanislaw", "Adaszewski", role = "cph",
           comment = "author of include concaveman-cpp code") 
  )
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/UrbanAnalyst/dodgr,
    https://urbananalyst.github.io/dodgr/
BugReports: https://github.com/UrbanAnalyst/dodgr/issues
Depends: 
    R (>= 3.5.0)
Imports:
    callr,
    digest,
    fs,
    magrittr,
    memoise,
    methods,
    osmdata,
    Rcpp (>= 0.12.6),
    RcppParallel
Suggests:
    bench,
    dplyr,
    geodist (>= 0.1.0),
    ggplot2,
    igraph,
    igraphdata,
    jsonlite,
    knitr,
    markdown,
    rmarkdown,
    sf,
    testthat (>= 3.1.6),
    tidygraph
LinkingTo:
    Rcpp,
    RcppParallel,
    RcppThread
VignetteBuilder: 
    knitr
Encoding: UTF-8
LazyData: true
NeedsCompilation: yes
Roxygen: list(markdown = TRUE)
RoxygenNote: 7.3.2
SystemRequirements: GNU make