ShortestPath

Calculates the shortest path between two vertices (based on the minimum amount of edges) and 
calculates its total weight

Tools to analyze point patterns in space occurring over planar network structures derived from graph-related intensity measures for undirected, directed, and mixed networks.
This package is based on the following research: Eckardt and Mateu (2018) <doi:10.1080/10618600.2017.1391695>. Eckardt and Mateu (2021) <doi:10.1007/s11749-020-00720-4>.

Pol Llagostera

intensitynet

Intensity Analysis of Spatial Point Patterns on Complex Networks

Matthias Eckardt

ShortestPath function

<dl><dt>obj</dt>
<dd>intensitynet object</dd>
<dt>node_id1</dt>
<dd>starting node</dd>
<dt>node_id2</dt>
<dd>ending node</dd>
<dt>weight</dt>
<dd>an string, calculate the shortest path based on this type of weight. If no weight type is provided,
the function will calculate the shortest path based on the minimum amount of edges. Default NA.</dd>
<dt>mode</dt>
<dd>Character 'in', 'out', 'all' (default). Gives whether the shortest paths to or from the given vertices 
should be calculated for directed graphs. If out then the shortest paths from the vertex, if in 
then to it will be considered. If all, the default, then the corresponding undirected graph will be used, ie. not 
directed paths are searched. This argument is ignored for undirected graphs.</dd></dl>

Arguments

Calculates the shortest path between two vertices (based on the minimum amount of edges) and 
calculates its total weight — ShortestPath

<dl>

<dt>obj</dt>
<dd>intensitynet object</dd>


<dt>node_id1</dt>
<dd>starting node</dd>


<dt>node_id2</dt>
<dd>ending node</dd>


<dt>weight</dt>
<dd>an string, calculate the shortest path based on this type of weight. If no weight type is provided,
the function will calculate the shortest path based on the minimum amount of edges. Default NA.</dd>


<dt>mode</dt>
<dd>Character 'in', 'out', 'all' (default). Gives whether the shortest paths to or from the given vertices 
should be calculated for directed graphs. If out then the shortest paths from the vertex, if in 
then to it will be considered. If all, the default, then the corresponding undirected graph will be used, ie. not 
directed paths are searched. This argument is ignored for undirected graphs.</dd>

</dl>

ShortestPath: Calculates the shortest path between two vertices (based on the minimum amount of edges) and calculates its total weight

Description

Usage

Value

Arguments

Examples