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 (graph theory) An algorithm that computes single-source shortest paths in a weighted digraph.