dijkstra: Dijkstra

In dimitramuni/euclidijk: Highest Common Factor And Finds Shortest Path

Description

Dijkstra algorithm finds the shortest path for a given graph from a input node.

Usage

dijkstra(df, n)

Arguments

df	Data.Frame
n	numeric_variable

Value

vector shortest path vector df from source node n

References

https://en.wikipedia.org/wiki/Dijkstra

Examples

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)

## Not run: dijkstra(1:100,5)
## Not run: dijkstra(1:100,"A")

dimitramuni/euclidijk documentation built on Nov. 4, 2019, 10:31 a.m.