Dijkstra's Shortest-Path Algorithm

From NovaOrdis Knowledge Base
Revision as of 19:22, 14 October 2021 by Ovidiu (talk | contribs) (Ovidiu moved page Dijkstra's Algorithm to Dijkstra's Shortest-Path Algorithm without leaving a redirect)
Jump to navigation Jump to search

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.

Retrieved from "https://kb.novaordis.com/index.php?title=Dijkstra%27s_Shortest-Path_Algorithm&oldid=83799"