A Comparative Study on Shortest Path Visualization using Artificial Intelligence

In the modern computation system, that rely on various aspects to obtain the optimal results in easy manner appears more deterministic. There are several algorithms available that can distinguish a probable shortest path between two points, which helps students actively study algorithms with visualization. Therefore, in this study, we developed the GUI based shortest path finding tool consists of Dijkstra and A* algorithm. Further, in this study, the obtained shortest path results were graphically visualised and tabular output are stored in the database. The implementation of the algorithm and visualization was developed using Java AWT API and SWING package of Java. The Dijkstra and A* algorithm comparative analysis showed that the checks value and path length in terms of the A* algorithm is comparatively less than Dijkstra. Thus, it is affirmative that A * approach produces faster results and appeared as more efficient in terms of destination path finding than Dijkstra algorithm. Path finding is a fundamental feature of many significant applications and can be applied in static, interactive, and real-time situations. Such information shed light on the efficient application for computer gaming, robots, logistics, and crowd simulation.