dijkstra: Calculate the Shortest distance between two points

In RajaHussnain/Lab3Package: Implementation of Euclidean and Dijkstra

Description

Calculate the Shortest distance between two points

Usage

dijkstra(graph, init_node)

Arguments

graph	Data frame
init_node	Initial node

Value

Return Shortest Path

Source

https://en.wikipedia.org/wiki/Dijkstra%27s_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)

RajaHussnain/Lab3Package documentation built on Dec. 18, 2021, 9:51 a.m.