Method for Optimal Route

Abstract

Describes the work on modern scientific achievements in graph theory, studying the developed algorithms, comparing their advantages and disadvantages, the reason for choosing the Ford-Bellman algorithm as a tool for solving the problem. The principle of the Ford-Bellman Algorithm and its structure were also described. The works on designing the architecture of Ford-Bellman algorithms in C # language, designing a class hierarchy for geometric objects modeling graphs, designing a model that implements threedimensional geometric space were described. The architecture of the graphical interface and the hierarchy of its classes were also described. The paper describes the implementation of the model, which searches for the shortest route between any two points of the graph, the implementation of the graphical interface through which the algorithm is controlled. As a result of the work, the design and development of the application for finding the shortest route in a weighted connected pseudograph was carried out. The algorithm has been tested. The algorithm works and successfully performs the task. The algorithm was encapsulated and allocated to a separate class library, which makes it possible to use it in many other projects of different industries. It can be used for engineering calculations in which the problem can be represented as a graph; in tasks where it is necessary to find the shortest path from one point to another; in robotics and systems with artificial intelligence.