dijkstra: Dijkstra's algorithm, finds shortest distance to other nodes

In martynas2514/Lab03: Euclidean and Dijkstra algorithms

Description

The algorithm takes a graph and an initial node and calculates the shortest path from the initial node to every other node in the graph. Find Wikipedia docs Here.

Usage

dijkstra(graph, init_node)

Arguments

graph	Data.frame object 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	initial node (must be a scalar number).

Value

vector of distances

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)

martynas2514/Lab03 documentation built on Sept. 12, 2020, 11:37 a.m.