dijkstra: Finds the shortest paths between nodes in a graph

In ahmedNwayyir/myFirstRPackage: First R Package

Description

dijkstra() takes a graph and an initial node and calculates the shortest path from the initial node to every other node in the graph.

Usage

dijkstra(graph, init_node)

Arguments

graph	A data frame.
init_node	A number.

Value

The vector of the shortest path to every other node from the starting node.

References

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)

ahmedNwayyir/myFirstRPackage documentation built on July 7, 2020, 1:15 a.m.