Dijkstra Shortest Path Algorithm using Global Position System

Abstract

Dijkstra's Algorithm is used to find the shortest path from one node to another node in a graph.Dijkstra's algorithm is also known as a single source shortest path algorithm. It is applied only on positive weights. In this paper, Global Positioning System is used for adding a new functionality in Dijkstra's algorithm. In this paper, using Global Positioning System the position parameter is added in the Dijkstra's algorithm. From this current position is retrieved at any point. By using this current position, the distance can be determined from one node to another node. The shortest path can also find out using this distance. For this an algorithm is proposed.