Copyright © 2026 Authors retain the copyright of this article. This article is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

@article{169055,
        author = {Shishir Govinda M and Thrisha V S},
        title = {A* and Dijkstra’s algorithm simultaneously on NVIDIA  GPU using CUDA C++},
        journal = {International Journal of Innovative Research in Technology},
        year = {2025},
        volume = {11},
        number = {6},
        pages = {236-244},
        issn = {2349-6002},
        url = {https://ijirt.org/article?manuscript=169055},
        abstract = {A* algorithms is the best known path finding algorithm which is guided by a heuristic function to reach the goal node. Dijkstra’s path finding algorithm works on greedy method i.e., it checks all the neighbouring nodes and is not guided by a heuristic function. In this paper, we try to achieve a much faster way of computing the path by combining both A* and Dijkstra’s algorithm, where in we will be using A* algorithm from the start node and Dijkstra’s algorithm from the goal node and at the point of intersection we will have our path. To further increase the speed of computation we will be making use of Nvidia’s GPU computation via CUDA C++. We will also see the computational speed difference between serial CPU computation and parallel GPU calculation and comparing the results learned with Amdahl’s Law in Parallel Computing. We will also look at some of the hindrances faced while enabling computation with Nvidia GPU using CUDA C++, which are non-existent with GPU computation.},
        keywords = {CUDA, C++, A*, Dijkstra, GPU, CPU, Path finding.},
        month = {January},
        }