Home / Technical / Programming / Algorithm / Dijkstra’s algorithm

Dijkstra’s algorithm

Dijkstra’s algorithm, conceived by Dutch computer scientist Edsger Dijkstra in 1959,[1] is a graph search algorithm that solves
the single-source shortest path problem for a graph with non negative edge path costs, outputting a shortest
path tree. This algorithm is often used in routing.

About Mohammad Khazab

Leave a Reply

%d bloggers like this: