shortest_path

Find shortest path between a pair of nodes in the network.

internal

Provides tools to automate the morphological delineation of
riverside urban areas based on a method introduced in Forgaci (2018)
<doi:10.7480/abe.2018.31>. Delineation entails the identification of
corridor boundaries, segmentation of the corridor, and delineation of
the river space using two-dimensional spatial information from street
network data and digital elevation data in a projected CRS. The
resulting delineation can be used to characterise spatial phenomena
that can be related to the river as a central element.

Claudiu Forgaci

rcrisp

Automate the Delineation of Urban River Spaces

Francesco Nattino

Fakhereh Alidoost

Meiert Willem Grootes

Netherlands eScience Center 

shortest_path function

<dl><dt>network</dt>
<dd>A spatial network object of class <code>sfnetworks::sfnetwork</code></dd>
<dt>from</dt>
<dd>Start node</dd>
<dt>to</dt>
<dd>End node</dd>
<dt>weights</dt>
<dd>Name of the column in the network edge table from where to
take the weigths</dd></dl>

Arguments

Find shortest path between a pair of nodes in the network. — shortest_path

<dl>

<dt>network</dt>
<dd>A spatial network object of class <code>sfnetworks::sfnetwork</code></dd>


<dt>from</dt>
<dd>Start node</dd>


<dt>to</dt>
<dd>End node</dd>


<dt>weights</dt>
<dd>Name of the column in the network edge table from where to
take the weigths</dd>

</dl>

shortest_path: Find shortest path between a pair of nodes in the network.

Description

Usage

Value

Arguments