Generation and Search for the Shortest Path in Two-dimensional Labyrinths as A Model for Optimizing Routing Processes in the Packet Switching Network

The algorithms for generating and finding the shortest path in two-dimensional labyrinths and their characteristics are considered. The aim of the study is to determine the dependence of the working time of the shortest path search algorithms on the characteristics of mazes. This may allow these algorithms to be used to optimise routing processes in packet switching networks. All of the characteristics of the algorithms under consideration are described in detail. These search algorithms also allow for paralleling, so they can be used when creating games or any special applications. Such generation algorithms have been selected, the resulting mazes of which have different characteristics, thus making it possible to determine the required dependence. The peculiarity of applying the result of this research is that the fastest search algorithm can be selected for the generation algorithm or for specific characteristics of an already generated maze. The search algorithms can be improved to find paths in mazes in N-dimensional spaces. This search extension possibility can be widely used not only for working with mazes, but also with any other structure of a given coordinate system.