Distances on Directed Graphs
Cumulative distances along different edge categories
Calculate vector of shortest distances from a series of 'from' points ...
Calculate matrix of pair-wise distances between points.
Convert a igraph network to an equivalent dodgr representation.
Alias for match_pts_to_graph
Calculate matrix of pair-wise distances between points.
Insert new nodes into a graph, breaking edges at point of nearest inte...
Remove cached versions of dodgr graphs.
Compare timings of different sort heaps for a given input graph.
Turn off all dodgr caching in current session.
Turn on all dodgr caching in current session.
Calculate betweenness centrality for a 'dodgr' network.
Identify connected components of graph.
Contract graph to junction vertices only.
Deduplicate edges in a graph
Create a map of dodgr flows.
Aggregate flows throughout a network.
Aggregate flows dispersed from each point in a network.
Aggregate flows throughout a network using a spatial interaction model...
Calculate fundamental cycles on a FULL (that is, non-contracted) graph...
Calculate fundamental cycles in a graph.
Insert a new node or vertex into a network
Calculate isochrone contours from specified points.
Calculate isodistance contours from specified points.
Calculate isodistance or isochrone contours from specified points.
Load a street network previously saved with dodgr_save_streetnet .
Calculate lists of pair-wise shortest paths between points.
Sample a random but connected sub-component of a graph
Save a weighted streetnet to a local file
Convert sf LINESTRING objects to POLYGON objects representing al...
Extract a street network in silicate-format for a given location.
Extract a street network in sf-format for a given location.
Calculate matrix of pair-wise travel times between points.
Convert a dodgr graph to an igraph.
Convert a dodgr graph into an equivalent sf object.
Convert a dodgr graph into an equivalent sf::sfc object.
Convert a dodgr graph to an tidygraph.
Re-expand a contracted graph.
Extract vertices of graph, including spatial coordinates if included.
Distances On Directed GRaphs ("dodgr")
Estimate a value for the 'dist_threshold' parameter of the dodgr_centr...
Estimate time required for a planned centrality calculation.
Alias for match_pts_to_verts
Match spatial points to the edges of a spatial graph.
Match spatial points to the vertices of a spatial graph.
Merge directed edges into equivalent undirected edges.
Pipe operator
Transform a result from dodgr_dists_categorical to summary statistics
Weight a network for routing along railways.
Weight a street network according to a specified weighting profile.
Write dodgr weighting profiles to local file.
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.
Useful links