Algorithm for Finding the Shortest Path Between Moving Objects in the Transport Network
A method for finding the optimal route for information exchange between mobile objects of the transport network is considered. An algorithm for finding the shortest path from one moving object to all the others has been developed based on Dijkstra's algorithm. A specific example of the implementation of the algorithm proposed in the article is given. The results of simulation modeling of the developed algorithm are presented in comparison with the algorithm for finding the shortest path in the Bellman-Ford graph with an increase in the number of vertices in the graph. Application of the developed algorithm will make it possible to build an optimal route for information interconnection of mobile objects, which will significantly increase the efficiency of transport network management.