Shortest Path Map

I developed a shortest path program for my Algorithms course at the University of Miami. It creates a graph structure by reading location and road data from files, then prompts the user to enter two cities in the United States. It then calculates the shortest path between the cities and shows it on a map that includes elevation.

C++

I used C++ with object-oriented principles to create both the console interface and the graphical map window.

Version Control

The code base was tracked with the Git version control software throughout the development software. This made it possible to work on one feature at a time without having to worry about messing up existing functionality.

Dijkstra's Algorithm

As part of the course, I learned about Dijkstra's efficient algorithm for traversing a graph and finding the shortest path between two nodes. Therefore, I implemented my own priority queue data structure to use for the algorithm.