dijkstra: Dijkstra Algorithm

In mhils/shortestpath: Shortest Path Algorithm Visualization

Description

Use Dijkstra's algorithm to solve a shortest path problem.

Usage

dijkstra(graph, from, to)

Arguments

graph	The graph object.
from	The source vertex
to	The target vertex

Details

Dijkstra is a single-source algorithm which cannot deal with negative edge weights. Technically, it is a special case of A*-Search (aStarSearch) where the heuristic function is zero.

Examples

g <- randomGraph(6)
d <- dijkstra(g, "A", "F")

plot(d)

for(step in d){
  print(step$min_dists)
}

mhils/shortestpath documentation built on Dec. 17, 2020, 3:19 p.m.