Dijkstra's algorithm

Contents

EnglishEdit

EtymologyEdit

After its developer Edsger W. Dijkstra.

PronunciationEdit

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

NounEdit

Dijkstra's algorithm (plural not attested)

  1. (graph theory) An algorithm that computes single-source shortest paths in a weighted digraph.