Nothing
dodgr: Distances on Directed Graphs
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.
Getting started
Browse package contents
Package details |
|
|---|---|
| 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), Stanislaw Adaszewski [cph] (author of include concaveman-cpp code) |
| Maintainer | Mark Padgham <mark.padgham@email.com> |
| License | GPL-3 |
| Version | 0.4.1 |
| URL | https://github.com/UrbanAnalyst/dodgr https://urbananalyst.github.io/dodgr/ |
| Package repository | View on CRAN |
| Installation |
Install the latest version of this package by entering the following in R:
|
Try the dodgr package in your browser
Any scripts or data that you put into this service are public.
