Dijkstra's Shortest-Path Algorithm: Difference between revisions
Jump to navigation
Jump to search
(Created page with "=Internal= * Shortest Path in a Graph =Overview=") |
|||
| Line 2: | Line 2: | ||
* [[Shortest Path in a Graph]] | * [[Shortest Path in a Graph]] | ||
=Overview= | =Overview= | ||
=Speed Up= | |||
The Dijkstra's algorithm can be speed up with the [[Heap#Canonical_Uses_of_a_Heap|use of a heap]]. | |||