With this implementation-based project, we wanted to explore the difference in results between Dijkstra's algorithm and the A-Star Heuristic algorithm for pathfinding applications by exploring different kinds of heuristic functions.
The dataset used to generate a graphical representation of the streets of Boston and to query their latitude and longitudinal coordinates was from a street-sweeping schedule. This dataset contained information about the starting street and ending street for the sweeping and the distance between them. We also looked at the peak traffic times and the traffic-heavy areas in Boston city and implemented the traffic heuristic accordingly.
This is the repository to store program and data files for the Data Structures and Algorithms Class Final Project.