Development of Tool for Visualizing Pathfinding Algorithms

Abstract

Dijkstra algorithm, A Search, Greedy Best-first Search, Swarm Search, Breadth-first and Depth-first are some of the popular algorithms today. As a beginner’s step to algorithms and their implementation, this paper demonstrates how the pathfinding algorithm works. Moreover, the user can get a better perception of how different algorithms function and how programming works, in general. By understanding these algorithms, they will also get a basic idea of how to implement various navigation tools. The visualizer comprises a grid page that contains a ‘start node’ and an ‘end node’. The viewer can add various features such as a maze, walls and weights to improve the general outlook and understand how these pathfinding algorithms tackle our day-to-day problems. To build a visualizer, a programmer needs a fair knowledge of front-end programming languages and a good understanding of pathfinding Algorithms.