Решение задачи поиска оптимального пути между двумя точками на графе с нерегулярным весом ребер

Developed and implemented in the code an algorithm that solves the problem of finding the optimal path between two points on a graph with irregular edges of weight. The algorithm is an extension of the algorithm A *. The optimization of computational CPU time is produced