4 On the fuel saving operation for coastal merchant ships using weather routing

Edsger W. Dijkstra in 1959; it is one of the most common algorithms for solving the shortest path problem, it finds the shortest path from a single source vertex to other vertices in a graph that is weighted (non negatively weighted), directed and connected.