In recent years, a large number of studies were carried out in the field of finding and constructing the optimal path of movement. However, the task remains relevant due to the emergence of new aspects in this problem. The paper discusses and describes the existing algorithms for finding the shortest path on the graph. The material can be useful in building navigation systems and automated control in terms of the choice of optimal path.