WazeApp is an independent side project.
It is an interactive web application which displays California road network and enables k shortest paths between two locations.
Demo video link: https://drive.google.com/open?id=0B80WQs3npy5tTDAxck9sOFM5NDA.
-
Shows or hides all location markers (marker clusters) by clicking the button of "markers".
-
Shows an info-window and adjacency edges of a location when clicking on this location marker.
-
By typing in location number in the start and end text boxes and the number of shortest paths k, it computes k shortest paths between these two locations and draws the routes on the map.
-
Reference the implementation of fibonacci heap from Stanford - Keith Schwarz. Time and space complexity to compute the shortest path is VlogV + E (V: number of nodes, E: number of edges).
Googlemap api, java, jsp, java servlet, jQuery, html, css, javascript, Mysql, Tomcat
Set up nodes table and edges table in Mysql database. In the src folder, the Demo.java runs the program locally without frontend. If tomcat server is setted up, then run index.html which is the main page of this project.
cal.cnode.txt provides nodes (locations) with altitude, longitude and node number. cal.cedge.txt provides edges (roads) with starting node number, end node number and distance. Feifei Li, Dihan Cheng, Marios Hadjieleftheriou, George Kollios and Shang-Hua Teng, “On Trip Planning Queries in Spatial Databases”, In Proceedings of the 9th International Symposium on Spatial and Temporal Databases (SSTD ’05), 2005.