Dijkstra's algorithm

English

Etymology

After its developer Edsger W. Dijkstra.

Pronunciation

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

Proper noun

Dijkstra's algorithm

  1. (graph theory) An algorithm that computes single-source shortest paths in a weighted digraph.
This article is issued from Wiktionary. The text is available under Creative Commons Attribution-Share Alike 4.0 unless otherwise noted. Additional terms may apply for the media files.