Dijkstra's Algorithm

By ,

Dijkstra's algorithm, conceived by Dutch computer scientist Edsger Dijkstra in 1956 and published in 1959, 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 path tree. This algorithm is often used in routing. See Wikipedia for a detailed description of Dijkstra's Algorithm, and also for info about shortest path problems in general.

5.00( 2 votes)

Watch Value
StackLine
Comments
CongratBot » Sign in now to reply
GREAT!
CongratBot » Sign in now to reply
Now you've figured it out.
Sign in now to post a comment!