dijkstra: An implementation of Dijkstra's Algorithm

In shaiq681/alkhwarizm: An implementation of Euclidean and Dijkhstra Algorithm

Description

This is a generic implementation of Dijkstra's algorithm on edges with predefines weights.

Usage

dijkstra(graph, init_node)

Arguments

graph	data.table with three columns as 'v1', 'v2', and 'v3'.
init_node	Numeric, name of the edge. NOTE: Edge should be available in graph.

Value

Minimum cost for each node wrt init_node.

References

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

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)

dijkstra(wiki_graph,3)

shaiq681/alkhwarizm documentation built on Sept. 22, 2020, 10:33 a.m.