Stepanov

 The author proposes an algorithm of solving the problem of determination of optimal and all near-optimal routes from one point to another. The problem was turned into determination of multiple paths between two nodes in the graph representing the city. A modification of the Dijkstra algorithm was proposed to solve the problem. The algorithm was implemented in JAVA as a software system. The calculations carried out by means of a program complex showed the efficiency of the algorithm when solving good-sized problems.