Dijkstra's Shortest-Path Algorithm

Internal

• Shortest Path in a Graph

Speed Up

The Dijkstra's algorithm can be speed up with the use of a heap. TODO: https://www.coursera.org/learn/algorithms-graphs-data-structures/lecture/iIzo8/heaps-operations-and-applications.