The Dijkstra algorithm proposes an algorithm for generating the shortest path to each vertex in increasing order of the path length between each vertex and the source point v. First, find the shortest path with the shortest length, and then use it to find the shortest path with the next shortest length, and so on, until all shortest paths from the source point v to other vertices are found.