What algorithm to use to find the path in the building?

Question

Android

Hello, there was an idea to make an application to find the path through the building of the university, to clarify the location of the couples. the implementation will be on android studio.
The essence will be this, at startup, you need to specify your group, the application will pull out either from an excel file or from some other (not thought out) schedule data, and display to the user the ground floor plan and the inscription you now have "item name".
And the arrow will show the direction either to one of the stairs (there are two wings and both are connected only on the 2nd floor by a passage, and the remaining 5 are independent)
When you click on the arrow, it will go to the floor above and so on, until the arrow points to the office. How can I organize this using android studio?

Answer 1

I remember we also solved a typical problem at the university. I chose Dijkstra's algorithm, finishing it so that the construction of the shortest path was not only in the floor and building graph, but throughout the campus. At the same time, everything worked quickly and perfectly even on the weakest devices.
This is one of the old versions, sorry for the design. If you are interested, please contact
me

Answer 2

I would use Floyd's algorithm (runs once and gives all possible paths from any to any node in the form of a table). Run it on the PC, and drive the result directly into the application, where, through geolocation (if the connection is good), determine the position of the student and highlight the nearest node of the path, when you click on it, the next one, etc.