Dijkstra's algorithm

EnglishEdit

EtymologyEdit

After its developer Edsger W. Dijkstra.

PronunciationEdit

  • (UK) IPA(key): [ˈdaɪkstɹəz ˈæɫgəɹɪθəm]

NounEdit

Dijkstra's algorithm (uncountable)

Wikipedia has an article on:

Wikipedia

  1. (graph theory) An algorithm that computes single-source shortest paths in a weighted digraph.
Last modified on 29 March 2014, at 18:52