A city route finder for Waterford City.
A cooperative project that was my final assesment for my Data Structures and Algorithms 2 module. This project incorporates Dijkstra's algorithm and depth-first search to find either the shortest route or the most historic route. However the user chooses. The user can select any point on the roads for starting and ending points.
https://github.com/11xnt/WaterfordCityRoute
- Milan Ples [https://github.com/Kasdal]