dijkstra: Dijkstra's Algorithm
In lwa19/centrality: Compute network centrality without generating a graph object
Description
Usage
Arguments
Value
Examples
Description
dijkstra calculates the geodesics
from the source node to all other nodes in the graph
Usage
1
dijkstra(A.mat, src)
Arguments
A.mat
An n x n adjacency matrix.
src
A positive integer from 1 to n indicating the start node index
Value
Returns a list of dist and paths
Examples
1
2
A.mat = sim_adjacency(10, weight = c(1, 5))
dijkstra(A.mat, src = 1)
lwa19/centrality documentation built on Dec. 21, 2021, 12:45 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 Examples
Description
dijkstra calculates the geodesics
from the source node to all other nodes in the graph
Usage
1 | dijkstra(A.mat, src)
|
Arguments
A.mat |
An n x n adjacency matrix. |
src |
A positive integer from 1 to |
Value
Returns a list of dist and paths
Examples
1 2 | A.mat = sim_adjacency(10, weight = c(1, 5))
dijkstra(A.mat, src = 1)
|
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.