Inspiration my university NUST is really big and it is easy to get lost
What it does is helps you find the shortest distance and the path between two points in the university.
How I built it is using A* algorithm and swift language.
Challenges I ran into implementing A* with Kmaps was not easy.
Accomplishments that I'm proud of implementing Kmaps and finding path using A* algorithm.
What I learned implementation of A* and graphs
What's next for Never get Lost in NUST. It can be implemented in any other location as well, only by changing the vertices positions according to the new location.