Dijkstra's algorithm

English

Etymology

After its developer Edsger W. Dijkstra.

Pronunciation

  • (UK) IPA(key): [ˈdaɪkstɹəz ˈæɫɡəɹɪθə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 licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.