Finding the shortest path from a source vertex to all other vertices in a graph!
I have sketched a proof of the correctness of Dijkstra's algorithm, using induction. Now I am looking to prove the "similar to Dijkstra's algorithm- the backwards algorithm"! It works by looking at the distance to the vertex closest from a source vertex, then the distance from those vertices ,.. and so on, until the shortest distance for all vertices has been found. My question is what is this algorithm called apart from "the backward algorithm". The only hint I have is that the Dijkstra's algorithm is called the forward algorithm.