Dijkstra's Shortest-Path Algorithm

From NovaOrdis Knowledge Base

Revision as of 22:42, 9 October 2021 by Ovidiu (talk | contribs) (→‎Overview)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Jump to navigation Jump to search

Internal

Shortest Path in a Graph

Overview

Speed Up

The Dijkstra's algorithm can be speed up with the use of a heap.

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