dijkstra: Takes a graph and an initial node and calculates the shortest...
In Philhoels/Lab3AdvR: Uses the euclidean and dijkstra algorihtm
Description
Usage
Arguments
Value
References
Examples
Description
It is an algorithm used for finding the shortest path from a single node to a single destination node
by stopping the algorithm onc e the shortest path to the destination node has been determined.
Usage
1
dijkstra(graph, init_node)
Arguments
graph
A data frame.
init_node
A number.
Value
The vector of the shortest path to every other node from the starting node.
References
Examples
1
2
dijkstra(wiki_graph, 1)
dijkstra(wiki_graph, 3)
Philhoels/Lab3AdvR documentation built on May 9, 2019, 3:28 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.
Description Usage Arguments Value References Examples
Description
It is an algorithm used for finding the shortest path from a single node to a single destination node by stopping the algorithm onc e the shortest path to the destination node has been determined.
Usage
1 | dijkstra(graph, init_node)
|
Arguments
graph |
A data frame. |
init_node |
A number. |
Value
The vector of the shortest path to every other node from the starting node.
References
Examples
1 2 | dijkstra(wiki_graph, 1)
dijkstra(wiki_graph, 3)
|
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.