Dijkstra s algorithm, conceived by Dutch computer scientist Edsger Dijkstra in 1956 and published in 1959is a graph search algorithm that solves the single-source shortest path problem for a graph with nonnegative edge path costs, producing a shortes

this the algorithm to find the shortest path source to destination. It can be used to find and device the routing table-this the algorithm to find the shortest path source to destination. It can be used to find and device the routing table