ShortestNodeDistance.intensitynet: Given two nodes, gives its shortest distance based on the...
In intensitynet: Intensity Analysis of Spatial Point Patterns on Complex Networks
ShortestNodeDistance.intensitynet R Documentation
Given two nodes, gives its shortest distance based on the minimum amount of edges
Description
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.
Usage
## S3 method for class 'intensitynet'
ShortestNodeDistance(obj, node_id1, node_id2)
Arguments
obj
intensitynet object
node_id1
id of the starting node
node_id2
id of the end node
Value
distance of the path and the nodes of the path
intensitynet documentation built on April 11, 2023, 6:07 p.m.
R Package Documentation
Browse R Packages
We want your feedback!
Note that we can't provide technical support on individual packages. You should contact the package authors for that.
| ShortestNodeDistance.intensitynet | R Documentation |
Given two nodes, gives its shortest distance based on the minimum amount of edges
Description
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.
Usage
## S3 method for class 'intensitynet'
ShortestNodeDistance(obj, node_id1, node_id2)
Arguments
obj |
intensitynet object |
node_id1 |
id of the starting node |
node_id2 |
id of the end node |
Value
distance of the path and the nodes of the path
R Package Documentation
Browse R Packages
We want your feedback!
Note that we can't provide technical support on individual packages. You should contact the package authors for that.
Embedding an R snippet on your website
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.