dijkstra: Dijkstra Algorithm

In TheodorEmanuelsson/dijkstrasAlgorithm: Computes Euclidean and Dijkstra's algorithms in R

Description

Dijkstra Algorithm

Usage

dijkstra(graph, init_node)

Arguments

graph	Data.frame with three variables (v1, v2 and w) that contains the edges of the graph (from v1 to v2) with the weight of the edge (w).
init_node	Numeric scalar that is the starting node.

Value

Returns the shortest path to every other node from the starting node as a vector.

Source

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

Examples

dijkstra(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)), 1)
dijkstra(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)), 3)

TheodorEmanuelsson/dijkstrasAlgorithm documentation built on Dec. 18, 2021, 4:11 p.m.