Description Usage Arguments Value Examples
Find the shortest distance from init_node
to all nodes in graph
.
1 | dijkstra(graph, init_node)
|
graph, |
a graph table with all neighbors and the distance to them. |
init_node, |
a starting point of numeric numbers. |
The shortest distance from init_node
to all nodes in graph
.
1 2 3 4 5 6 | wiki_graph <-
data.frame(v1=c(1,1,1,2,2,2,3,3,3,3,4,4,4,5,5,6,6,6),
v2=c(2,3,6,1,3,4,1,2,4,6,2,3,5,4,6,1,3,5),
w=c(7,9,14,7,10,15,9,10,11,2,15,11,6,6,9,14,2,9))
dijkstra(wiki_graph, 1)
dijkstra(wiki_graph, 3)
|
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.