Dijkstra's algorithm

UK/ˈdaɪkstɹəz ˈælɡəɹɪðəm/

proper noun

An algorithm that computes single-source shortest paths in a weighted digraph.

Ask AI about this wordChatGPTClaudePerplexityGoogle AIGrok

Meanings

proper noun
  1. computerAn algorithm that computes single-source shortest paths in a weighted digraph.

Origin

After its developer Edsger W. Dijkstra.

Full word history & related roots →

Translations

Arabic خَوَارِزْمِيَّة دِيكْسْتْرَا
  • خَوَارِزْمِيَّة دِيكْسْتْرَاgraph theory
Cite this entry
APA

Dijkstra's algorithm. (n.d.). In WatkinsX Dictionary. Retrieved November 2, 2026, from https://dictionary.watkinsx.com/word/Dijkstra's%20algorithm

MLA

“Dijkstra's algorithm.” WatkinsX Dictionary, https://dictionary.watkinsx.com/word/Dijkstra's%20algorithm. Accessed November 2, 2026.

Chicago

WatkinsX Dictionary, s.v. “Dijkstra's algorithm,” accessed November 2, 2026, https://dictionary.watkinsx.com/word/Dijkstra's%20algorithm.

Source: Dijkstra's algorithm on Wiktionary, CC BY-SA 4.0.