ShortestNodeDistance.intensitynet

Calculates the shortest distance path between two nodes (based on the minimum amount of edges).
The function also returns the total weight of the path, if the weight is not available, returns
the number of edges.

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

ShortestNodeDistance.intensitynet function

<dl><dt>obj</dt>
<dd>intensitynet object</dd>
<dt>node_id1</dt>
<dd>id of the starting node</dd>
<dt>node_id2</dt>
<dd>id of the end node</dd></dl>

Arguments

Calculates the shortest distance path between two nodes (based on the minimum amount of edges).
The function also returns the total weight of the path, if the weight is not available, returns
the number of edges. — ShortestNodeDistance.intensitynet

<dl>

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


<dt>node_id1</dt>
<dd>id of the starting node</dd>


<dt>node_id2</dt>
<dd>id of the end node</dd>

</dl>

Calculates the shortest distance path between two nodes (based on the minimum amount of edges).
The function also returns the total weight of the path, if the weight is not available, returns
the number of edges.

ShortestNodeDistance.intensitynet: Calculates the shortest distance path between two nodes (based on the minimum amount of edges). The function also returns the total weight of the path, if the weight is not available, returns the number of edges.

Description

Usage

Value

Arguments