Husky Maps

Husky Maps was a class project for the Software Design and Implementation course, designed to showcase the power of graph algorithms. I made all design and implementation decisions to adhere to the specific task assigned. The ultimate goal was to develop a web interface that displayed a map of the University of Washington (UW) campus and allowed users to find the shortest paths between two specified buildings. This required not only creating a user-friendly web interface but also setting up a server to run the backend. Through this project, I demonstrated my ability to independently design and implement a functional and efficient application, highlighting my skills in software development, backend engineering, and problem-solving.

Link to repository

My role:

In this project, I played the role of the sole developer, responsible for all aspects of the design and implementation. I designed and implemented the classes for nodes, edges, and the graph in Java, utilizing generics to allow for various applications of the graph. I, also, created a highly efficient parser and parsing algorithm that could process a database of all of the Marvel characters in just 5 milliseconds, significantly outperforming the course staff's implementation, which took approximately 20 seconds. Since I worked independently, I did not need to collaborate with others to achieve my goals. The outcome of the project was a highly efficient and versatile graph implementation, showcasing my skills in software development, algorithm optimization, and problem-solving.