^{a}, Taher Ali Rangwala and Mahesh Agrawal

^{a}tarunbansal.me@gmail.com

With the advent of Google maps and other similar tools on the internet it has become very easy to zoom down to street view of most cities around the world. Graphical representation of these maps is also available on many websites and thus it is now possible to find the shortest path between important crossroads and junctions of a city. While finding out the shortest path between any two nodes in a graph the traditional GPS based devices consider distance as the only criteria. Various software are used which take user’s location from GPS system and accordingly show them correct path but this path are just based upon the distance between the initial position and the destination. In some cases this may result in a path which is short but more time consuming due to heavy traffic on the route. This paper presents an algorithm in which along with distance between the initial and the final position, the traffic between the routes is also taken into account in order to calculate the shortest path. Based on the traffic data new weights are assigned to the graph and then a more efficient shortest path is calculated for the convenience of commuters.