dodgr_to_igraph

Convert a <code>dodgr</code> graph to an igraph.

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_to_igraph function

<dl><dt>graph</dt>
<dd>A <code>dodgr</code> graph</dd>
<dt>weight_column</dt>
<dd>The column of the <code>dodgr</code> network to use as the edge
weights in the <code>igraph</code> representation.</dd></dl>

Arguments

Convert a dodgr graph to an igraph. — dodgr_to_igraph

<dl>

<dt>graph</dt>
<dd>A <code>dodgr</code> graph</dd>


<dt>weight_column</dt>
<dd>The column of the <code>dodgr</code> network to use as the edge
weights in the <code>igraph</code> representation.</dd>

</dl>

Convert a <code>dodgr</code> graph to an igraph.

dodgr_to_igraph: Convert a `dodgr` graph to an igraph.

Description

Usage

Value

Arguments

See Also

Examples