|
Dijkstra's algorithm - Wikipedia, the free encyclopedia
Dijkstra's algorithm, conceived by computer scientist Edsger Dijkstra in 1956 and published in 1959,[1][2] is a graph search algorithm that solves the single-source shortest path problem for a graph with non-negative edge path costs, producing a shortest
en.wikipedia.org |
|