Mobile application for finding the best route on campus

The actual task of developing a mobile application for finding the optimal route on a university campus is considered. The mathematical basis for designing a mobile application is the task of finding the shortest route in a graph whose vertices are classrooms, laboratories, libraries, departments, dean's offices, etc. in the buildings of the university.The analysis of the main characteristics of existing mobile applications for walking navigation has been carried out, their advantages and disadvantages have been identified. The well-known algorithms for finding the shortest path in a graph are considered: breadth-first search, greedy algorithm, and Dijkstra shortest path algorithm. For the task under consideration, a software implementation and an auxiliary service have been developed to create maps and bring them to a format in which a graph is automatically created for the correct operation of the application. The novelty of the proposed development lies in the possibility of displaying, adding and editing various maps. Further improvement of the developed mobile application can be carried out in the direction of increasing the accuracy of navigation by combining algorithms for finding paths in a graph, as well as in translating maps from 2D to 3D. The results of the study can be used to find the best routes in other universities.