• Anita
• Neeraj
• Abhishek Bansal

There are a lots of paths to go from one place to another place i.e. point A to point B in real road maps and Driver need to pick the best path. To do this, the pathfinding calculations is utilized. At present, a few calculations have been proposed for steering in recreations so the general difficulties of them is high utilization of memory and a long Execution time. Because of these issues, the improvement and presentation of new calculations will be proceeded. At the initial segment of this article, notwithstanding essential and imperative utilized calculations, everyone knows the point where the driver or user is and where they want to go. The map has roads (they are called edges) that connect the nodes (places with coordinates). From every node, the user can go to one or many edges. An edge has a cost (e.g. length of time it takes to travel it). For small maps, one could perhaps calculate all possible routes to the destination and select the shortest. For these calculations in the different modes and Simulated calculations various algorithms are Dijkstra, Iddfs, Biddfs, Bfs (Breadth-first search), Greedy Best First Search, Ida*, A*, Jump point seek, HPA*.

-Dijkstra algorithm, shortest path, small heap, passing point, heuristic, pathfinding

"SIMULATION AND COMPARISON OF EFFICENCY OF DIJKSTRA'S AND A* ALGORITHM ", International Journal of Emerging Technologies and Innovative Research (www.jetir.org), ISSN:2349-5162, Vol.5, Issue 12, page no.291-295, December-2018, Available :http://www.jetir.org/papers/JETIR1812847.pdf

"SIMULATION AND COMPARISON OF EFFICENCY OF DIJKSTRA'S AND A* ALGORITHM ", International Journal of Emerging Technologies and Innovative Research (www.jetir.org | UGC and issn Approved), ISSN:2349-5162, Vol.5, Issue 12, page no. pp291-295, December-2018, Available at : http://www.jetir.org/papers/JETIR1812847.pdf