dc.contributor.author | Arista, Emerald M. | |
dc.date.accessioned | 2024-06-04T02:02:08Z | |
dc.date.available | 2024-06-04T02:02:08Z | |
dc.date.issued | 2008-04 | |
dc.identifier.uri | http://dspace.cas.upm.edu.ph:8080/xmlui/handle/123456789/2714 | |
dc.description.abstract | The Google Maps Simplest Path Finder is a web-based application made to compute the simplest path between two points. There are two main users of the GMSPF application, the map editor who marks and labels the map with information and the ordinary user who uses this tagged map to input start and end points of his destination. The application then generates a simplest pain between these points. The map editor accesses the editing feature through a persona! account, to be able to modify the mao elements like the street polyline overlays and the markers that designate decision points or intersections in the map. He also functions as the administrator/ managing the other map editor accounts. | en_US |
dc.subject | Simplest path algorithm | en_US |
dc.subject | Graph theory | en_US |
dc.subject | Google Maps API | en_US |
dc.subject | Route selection | en_US |
dc.title | Google Maps Simplest Path Finder (GMSPF) | en_US |
dc.type | Thesis | en_US |