This project is a comprehensive Java application designed to calculate and visualize the shortest path between two locations on the Rensselaer Campus. Utilizing Dijkstra’s algorithm, the application allows users to input a starting and ending location. The system then dynamically renders the optimal route on a map interface, along with step-by-step directions displayed in the window.
Key components of the project include a graph-based model, where nodes represent campus locations and edges denote paths with distance values between them. This structure enables efficient pathfinding while keeping the application’s design scalable and intuitive.
Through this project, I enhanced my proficiency in several programming domains, including algorithm implementation (BFS and Dijkstra’s), user interface and graphical rendering, and the application of the Model-View-Controller (MVC) design pattern. Each of these elements contributed to building a robust and interactive user experience, reinforcing essential software engineering skills.
