dijkstra_nodes: Find the shortest paths to other vertices
In gretel: Generalized Path Analysis for Social Networks
Description
Usage
Arguments
Value
Description
Find the shortest paths to other vertices
Usage
1
dijkstra_nodes(dist, src, node_costs)
Arguments
dist
A matrix of distances between nodes
src
An integer vertex ID
node_costs
a list of costs, in order, of all nodes represented in the
sociomatrix, all are assumed 0 if unspecified
Value
A numeric vector, entry i of which is the vertex immediately preceeding
vertex i in the shortest path leading to i. Full paths must be constructed
recursively.
gretel documentation built on Aug. 22, 2019, 5:10 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.
Description Usage Arguments Value
Description
Find the shortest paths to other vertices
Usage
1 | dijkstra_nodes(dist, src, node_costs)
|
Arguments
dist |
A matrix of distances between nodes |
src |
An integer vertex ID |
node_costs |
a list of costs, in order, of all nodes represented in the sociomatrix, all are assumed 0 if unspecified |
Value
A numeric vector, entry i of which is the vertex immediately preceeding vertex i in the shortest path leading to i. Full paths must be constructed recursively.
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.