Dijkstra's Shortest-Path Algorithm: Difference between revisions
Jump to navigation
Jump to search
m (Ovidiu moved page Dijkstra's Algorithm to Dijkstra's Shortest-Path Algorithm without leaving a redirect) |
|
(No difference)
| |
Revision as of 19:22, 14 October 2021
Internal
Overview
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.