COMPARATIVE ANALYSIS OF METHODS FOR FINDING THE SHORTEST DISTANCE IN A GRAPH

Abstract

Currently, there is a high need to determine the shortest distances to form freight and passenger transportation routes. One of the most effective ways to determine routes of minimum length are methods of finding the shortest distances in a graph. The article discusses algorithms for finding shortest distances, as well as other methods based on the principles of their operation. It was conducted a comparative analysis to identify the advantages and disadvantages of using these methods in routing tasks.