Visualization and Analysis of Shortest Path Algorithms

This report describes the visualization of the finding shortest path using the different types of graph algorithms like Dijkstra, A-star, Breadth-First Search, and Depth-First Search. This research carries out the visualization as a learning aid for understanding the graph algorithms for any professional or novice. Visualization makes it easy to comprehend Algorithms rather than an explanation of data transferring. In any graph-based algorithm, there are nodes and edges which seem like a tree, but in this tool, there is a 2D graph where visualization takes place and provides an understanding of the algorithm in real-life scenarios. This tool is user-oriented where they can create their puzzles and build the different strategies to create a more fun and creative learning process. We hope that the visualization of algorithms will help all users to a good extent.