dodgr

Distances on Directed Graphs

Mark Padgham, David Cooley, Andreas Petutschnig

Last update: 2 June 2023

Copyright license: GNU General Public License, version 3.0

Software version identifier: 0.2.19, 0.0.1, 0.0.2, 0.0.3, 0.1.1, 0.1.2, 0.1.3, 0.1.4, 0.2.0, 0.2.1, 0.2.4, 0.2.5, 0.2.6, 0.2.7, 0.2.8, 0.2.9, 0.2.11, 0.2.12, 0.2.13, 0.2.14, 0.2.15, 0.2.16, 0.2.17, 0.2.18, 0.2.21

Source code repository: https://github.com/cran/dodgr

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.

Cites work

dodgr: An R package for network flow aggregation