Navigation within college campuses can be a challenging task for students, staff, and visitors. With the increasing reliance on smartphones as common utility, it is possible to develop dedicated navigation system aid in navigating these complex environments. In an effort improve upon traditional methods, we explored use of A* algorithm identified opportunity enhance its performance by implement...

For a given source vertex (node) in the graph, the algorithm finds the path with lowest cost (i.e. the shortest path) between that vertex and every other vertex. It can also be used for finding costs of shortest paths from a single vertex to a single destination vertex by stopping the algorithm once the shortest path to the destination vertex has been determined. For example, if the vertices of...