dodgr_deduplicate_graph

Graph may have duplicated edges, particularly when extracted as
dodgr_streetnet objects. This function de-duplicates any repeated
edges, reducing weighted distances and times to the minimal values from all
duplicates.

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.

Mark Padgham

dodgr

Distances on Directed Graphs

Andreas Petutschnig

David Cooley

Robin Lovelace

Andrew Smith

Malcolm Morgan

Andrea Gilardi

Shane Saunders

Stanislaw Adaszewski

dodgr_deduplicate_graph function

<dl><dt>graph</dt>
<dd>Any 'dodgr' graph or network.</dd></dl>

Arguments

Deduplicate edges in a graph — dodgr_deduplicate_graph

<dl>

<dt>graph</dt>
<dd>Any 'dodgr' graph or network.</dd>

</dl>

Deduplicate edges in a graph

dodgr_deduplicate_graph: Deduplicate edges in a graph

Description

Usage

Value

Arguments

See Also