dijkstra: Dijkstra's algorithm
In ionet: Network Analysis for Input-Output Tables
dijkstra R Documentation
Dijkstra's algorithm
Description
Implement the Dijkstra's algorithm to find the shortest paths from the source node to
all nodes in the given network.
Usage
dijkstra(adjmat, src)
Arguments
adjmat
The adjacency matrix of a directed, weighted network.
src
An integer specifying the given source node to find the shortest distance.
Value
A list of distance and previous node.
References
Dijkstra, E. W. (1959).
A Note on Two Problems in Connexion with Graphs.
Numerische Mathematik, 1, 269–271.
ionet documentation built on May 29, 2024, 2:29 a.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.
| dijkstra | R Documentation |
Dijkstra's algorithm
Description
Implement the Dijkstra's algorithm to find the shortest paths from the source node to all nodes in the given network.
Usage
dijkstra(adjmat, src)
Arguments
adjmat |
The adjacency matrix of a directed, weighted network. |
src |
An integer specifying the given source node to find the shortest distance. |
Value
A list of distance and previous node.
References
Dijkstra, E. W. (1959). A Note on Two Problems in Connexion with Graphs. Numerische Mathematik, 1, 269–271.
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.