Dijkstra's algorithm

Definition from Wiktionary, the free dictionary
Jump to: navigation, search

English[edit]

Etymology[edit]

After its developer Edsger W. Dijkstra.

Pronunciation[edit]

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

Noun[edit]

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.