A navigation system for New Zealand utilizing a pre-loaded graph of various cities and distances.
The heuristic A* search algorithm was utilized to traverse the graph while identifying the cities along the path. The cities and cost function may be selected via the dropdown menu within the GUI and the resulting the path is redrawn on the map along with a printout of the intermediary cities. The code is available here on Github.
The GUI features a map along with three drop-down menus. The map is sensitive to mouse zoom (via either a mousewheel or keyboard gesture) and drag features. Both the first and second dropdown menus list all the cities available for start and end locations respectively. The third dropdown menu allows the user to select between optimizing either the travel time or distance traveled.
Upon completing all three fields, pressing the Find Route Button will yeild the following display.
The green line highlights the route while the cities are displayed on the right. A list of attractions are displayed as well in addition to the total distance and a time statistic for development purposes. Since the highlighted route is redrawn over the original image, exiting and re-running the program is the only way to compute a new path.