CASE STUDY OF GOGGLE MAP

Prepared by :- Suraksha SanghaviDepartment of Computer

Why Use Graphs?Graphs serve as models of a wide range of objects:• A roadmap• A map of airline routes• A diagram of the flow capacities

in a communications or transportation network

• Google Maps is a web mapping service developed by Google. It offers satellite imagery, street maps, 360° panoramic views of streets (Street View), real-time traffic conditions (Google Traffic), and route planning for traveling by foot, car, bicycle (in beta), or public transportation.

What Is Google Map?

HistoryGoogle maps began as a C++ desktop program designed by Lars and Jens Eilstrup Rasmussen at Where 2 Technologies. In October 2004, the company was acquired by Google, which converted it into a web application. After additional acquisitions of a geospatial data visualization company and a realtime traffic analyzer, Google Maps was launched in February 2005.[1] The service's front end utilizes JavaScript, XML, and Ajax. Google Maps offers an API that allows maps to be embedded on third-party websites,[2] and offers a locator for urban businesses and other organizations in numerous countries around the world. Google Map Maker allows users to collaboratively expand and update the service's mapping worldwide  The current redesigned version of the desktop application was made available in 2013, alongside the "classic" (pre-2013) version. Google Maps for mobile was released in September 2008 and features GPSturn-by-turn navigation. In August 2013, it was determined to be the world's most popular app for smartphones, with over 54% of global smartphone owners using it at least once.[5] 

4.June 11, 2015.Google have updated their 'Latest Google Earth Imagery Updates' map. To view it in Google Earth use this KML file . The last time they updated this particular map was for the April 24th update

• The map is stored in an Edge Weighted Directed Graph. Locations on the map are Vertices and the path from one location to another (from one vertex to another) is the Edges.

• Quite obviously, since there can be millions of vertices and an order of magnitude more edges, the really interesting thing would be the representation of this Edge Weighted Digraph

• The single-source shortest path problem asks for a solution that contains the shortest paths from a given vertex to all of the other vertices

Has a widely used solution by DijkstraIs O(n2) and assumes that all weights must be positive

CONCLUSION1.It can colour the graph2.It can add pointer to point location3.It provide us direction with help of directed graph4.With help of shortest path algorithm it give us appropriate location where we have to reach