Dijkstra's algorithm

From Wiktionary, the free dictionary
Jump to navigation Jump to search

English

[edit]

Etymology

[edit]

After its developer Edsger W. Dijkstra.

Pronunciation

[edit]
  • (UK) IPA(key): /ˈdaɪkstɹəz ˈælɡəɹɪðəm/

Proper noun

[edit]

Dijkstra's algorithm

English Wikipedia has an article on:
Wikipedia
  1. (graph theory) An algorithm that computes single-source shortest paths in a weighted digraph.