Dijkstra's Shortest-Path Algorithm: Difference between revisions
Jump to navigation
Jump to search
| Line 3: | Line 3: | ||
=Overview= | =Overview= | ||
=Speed Up= | =Speed Up= | ||
The Dijkstra's algorithm can be speed up with the [[Heap#Canonical_Uses_of_a_Heap|use of a heap]]. | The Dijkstra's algorithm can be speed up with the [[Heap#Canonical_Uses_of_a_Heap|use of a heap]]. <font color=darkgray>TODO: https://www.coursera.org/learn/algorithms-graphs-data-structures/lecture/iIzo8/heaps-operations-and-applications</font>. | ||
Revision as of 22:43, 9 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.