Package: dodgr 0.4.1.023

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.

Authors:Mark Padgham [aut, cre], Andreas Petutschnig [aut], David Cooley [aut], Robin Lovelace [ctb], Andrew Smith [ctb], Malcolm Morgan [ctb], Shane Saunders [cph], Stanislaw Adaszewski [cph]

dodgr_0.4.1.023.tar.gz
dodgr_0.4.1.023.zip(r-4.5)dodgr_0.4.1.023.zip(r-4.4)dodgr_0.4.1.023.zip(r-4.3)
dodgr_0.4.1.023.tgz(r-4.4-x86_64)dodgr_0.4.1.023.tgz(r-4.4-arm64)dodgr_0.4.1.023.tgz(r-4.3-x86_64)dodgr_0.4.1.023.tgz(r-4.3-arm64)
dodgr_0.4.1.023.tar.gz(r-4.5-noble)dodgr_0.4.1.023.tar.gz(r-4.4-noble)
dodgr.pdf |dodgr.html✨
dodgr/json (API)
NEWS

# Install 'dodgr' in R:
install.packages('dodgr', repos = c('https://mpadge.r-universe.dev', 'https://cloud.r-project.org'))

Peer review:

Bug tracker:https://github.com/urbananalyst/dodgr/issues

Uses libs:
  • c++– GNU Standard C++ Library v3
Datasets:

On CRAN:

distanceopenstreetmaproutershortest-pathsstreet-networks

49 exports 127 stars 4.95 score 48 dependencies 1 dependents 2 mentions 96 scripts 985 downloads

Last updated 29 days agofrom:4abe6b339c. Checks:OK: 1 NOTE: 8. Indexed: no.

TargetResultDate
Doc / VignettesOKAug 09 2024
R-4.5-win-x86_64NOTEAug 09 2024
R-4.5-linux-x86_64NOTEAug 09 2024
R-4.4-win-x86_64NOTEAug 09 2024
R-4.4-mac-x86_64NOTEAug 09 2024
R-4.4-mac-aarch64NOTEAug 09 2024
R-4.3-win-x86_64NOTEAug 09 2024
R-4.3-mac-x86_64NOTEAug 09 2024
R-4.3-mac-aarch64NOTEAug 09 2024

Exports:%>%add_nodes_to_graphclear_dodgr_cachecompare_heapsdodgr_cache_offdodgr_cache_ondodgr_centralitydodgr_componentsdodgr_contract_graphdodgr_deduplicate_graphdodgr_distancesdodgr_distsdodgr_dists_categoricaldodgr_dists_nearestdodgr_flowmapdodgr_flows_aggregatedodgr_flows_dispersedodgr_flows_sidodgr_full_cyclesdodgr_fundamental_cyclesdodgr_insert_vertexdodgr_isochronesdodgr_isodistsdodgr_isovertsdodgr_load_streetnetdodgr_pathsdodgr_sampledodgr_save_streetnetdodgr_sflines_to_polydodgr_streetnetdodgr_streetnet_scdodgr_timesdodgr_to_igraphdodgr_to_sfdodgr_to_sfcdodgr_to_tidygraphdodgr_uncontract_graphdodgr_verticesestimate_centrality_thresholdestimate_centrality_timeigraph_to_dodgrmatch_points_to_graphmatch_points_to_vertsmatch_pts_to_graphmatch_pts_to_vertsmerge_directed_graphweight_railwayweight_streetnetwrite_dodgr_wt_profile

Dependencies:askpasscachemcallrclicpp11crsmetacurldigestfansifastmapfsgenericsgluehttrhttr2jsonlitelifecyclelubridatemagrittrmemoisemimeopensslosmdatapillarpkgconfigprocessxPROJproj4psR6rappdirsRcppRcppParallelRcppThreadreprojrlangrvestselectrstringistringrsystibbletimechangeutf8vctrswithrwkxml2

dodgr

Mark Padgham

Rendered fromdodgr.Rmdusingknitr::rmarkdownon Aug 09 2024.

Last update: 2023-06-09
Started: 2017-08-10

Street networks and time-based routing

Mark Padgham

Rendered fromtimes.Rmdusingknitr::rmarkdownon Aug 09 2024.

Last update: 2024-05-24
Started: 2019-04-13

dodgr flows

Mark Padgham

Rendered fromflows.Rmdusingknitr::rmarkdownon Aug 09 2024.

Last update: 2023-06-09
Started: 2019-11-12

Aggregating distances along categories of edges

Mark Padgham

Rendered fromdists-categorical.Rmdusingknitr::rmarkdownon Aug 09 2024.

Last update: 2023-06-09
Started: 2021-10-05

Parallel computation

Mark Padgham

Rendered fromparallel.Rmdusingknitr::rmarkdownon Aug 09 2024.

Last update: 2022-09-08
Started: 2022-09-08

Readme and manuals

Help Manual

Help pageTopics
Insert new nodes into a graph, breaking edges at point of nearest intersection.add_nodes_to_graph
Remove cached versions of 'dodgr' graphs.clear_dodgr_cache
Compare timings of different sort heaps for a given input graph.compare_heaps
Distances On Directed GRaphs ("dodgr")dodgr-package dodgr
Turn off all dodgr caching in current session.dodgr_cache_off
Turn on all dodgr caching in current session.dodgr_cache_on
Calculate betweenness centrality for a 'dodgr' network.dodgr_centrality
Identify connected components of graph.dodgr_components
Contract graph to junction vertices only.dodgr_contract_graph
Deduplicate edges in a graphdodgr_deduplicate_graph
Calculate matrix of pair-wise distances between points.dodgr_distances
Calculate matrix of pair-wise distances between points.dodgr_dists
Cumulative distances along different edge categoriesdodgr_dists_categorical
Calculate vector of shortest distances from a series of 'from' points to nearest one of series of 'to' points.dodgr_dists_nearest
Create a map of 'dodgr' flows.dodgr_flowmap
Aggregate flows throughout a network.dodgr_flows_aggregate
Aggregate flows dispersed from each point in a network.dodgr_flows_disperse
Aggregate flows throughout a network using a spatial interaction model.dodgr_flows_si
Calculate fundamental cycles on a FULL (that is, non-contracted) graph.dodgr_full_cycles
Calculate fundamental cycles in a graph.dodgr_fundamental_cycles
Insert a new node or vertex into a networkdodgr_insert_vertex
Calculate isochrone contours from specified points.dodgr_isochrones
Calculate isodistance contours from specified points.dodgr_isodists
Calculate isodistance or isochrone contours from specified points.dodgr_isoverts
Load a street network previously saved with dodgr_save_streetnet.dodgr_load_streetnet
Calculate lists of pair-wise shortest paths between points.dodgr_paths
Sample a random but connected sub-component of a graphdodgr_sample
Save a weighted streetnet to a local filedodgr_save_streetnet
Convert 'sf' 'LINESTRING' objects to 'POLYGON' objects representing all fundamental cycles within the 'LINESTRING' objects.dodgr_sflines_to_poly
Extract a street network in 'sf'-format for a given location.dodgr_streetnet
Extract a street network in 'silicate'-format for a given location.dodgr_streetnet_sc
Calculate matrix of pair-wise travel times between points.dodgr_times
Convert a 'dodgr' graph to an 'igraph'.dodgr_to_igraph
Convert a 'dodgr' graph into an equivalent 'sf' object.dodgr_to_sf
Convert a 'dodgr' graph into an equivalent 'sf::sfc' object.dodgr_to_sfc
Convert a 'dodgr' graph to an 'tidygraph'.dodgr_to_tidygraph
Re-expand a contracted graph.dodgr_uncontract_graph
Extract vertices of graph, including spatial coordinates if included.dodgr_vertices
Estimate a value for the 'dist_threshold' parameter of the dodgr_centrality function.estimate_centrality_threshold
Estimate time required for a planned centrality calculation.estimate_centrality_time
Sample street network from Hampi, India.hampi
Convert a 'igraph' network to an equivalent 'dodgr' representation.igraph_to_dodgr
Alias for match_pts_to_graphmatch_points_to_graph
Alias for match_pts_to_vertsmatch_points_to_verts
Match spatial points to the edges of a spatial graph.match_pts_to_graph
Match spatial points to the vertices of a spatial graph.match_pts_to_verts
Merge directed edges into equivalent undirected edges.merge_directed_graph
Sample street network from Bristol, U.K.os_roads_bristol
Transform a result from dodgr_dists_categorical to summary statisticssummary.dodgr_dists_categorical
Weight a network for routing along railways.weight_railway
Weight a street network according to a specified weighting profile.weight_streetnet weight_streetnet.default weight_streetnet.SC weight_streetnet.sc weight_streetnet.sf
Weighting profiles used to route different modes of transport.weighting_profiles
Write 'dodgr' weighting profiles to local file.write_dodgr_wt_profile