K J’s Educational Institute

K J College of Engineering and Management Research, Pune

Department of Computer Engineering
“VISUAL RENDERING OF PATH FINDING ALGORITHM”
1. Akash Athare 2. Omkar Gulave 3. Divvij Jaitly 4. Akshay Sharma
Guide Name: Prof. Rohini Waghole

ABSTRACT PROPOSED System

Algorithm visualization has been high topic in Computer science Minimum Spanning Tree
education for years, but it did not make its way through Educational
Institutions as the main educational tool. The present poster identifies two
key circumstances that an algorithm visualization must fulfil to be
successful: general availability of used software, and visualization of why
an algorithm solves the problem rather than what it is doing. One possible
method of “why” algorithm visualization is using algorithm unvarying
rather than showing the data conversion only. Invariants are known in
Program faultlessness. The main goal of the thesis was to create a program
which would serve as a tool for understanding how most known sorting
algorithms work. There was an attempt to make the best possible user
Toplogical Sorting
experience

INTRODUCTION

Algorithm is an integral part of computers and programming. It

provides consistency in solving similar tasks with a predictable and ARCHITECTURE
desirable outcome. Among algorithms, search algorithms are regarded as
the gateway to the world of algorithms in programming.
Evident by their definition, they are used to search data set with
similar properties. There are various types of so algorithm search with
their distinct implementations and strategies. They are often not as easy to
understand and absorb. A possible contributing factor can be the lack of
visualization of the process and steps each one takes to accomplish the
task of searching.
Therefore, the objective of this thesis was to create a web
application as a visualization tool for search Algorithms such as A-Star
Algorithm, Breadth First Search (BFS), Depth First Search (DFS), Conclusion
Dijkstra Algorithm.
Visualization of data makes it possible for re-searchers, analysts, The pathfinding algorithm visualizer is a tool that
engineers, and the audience to obtain insight in these data in an efficient can be used to visualize how pathfinding algorithms work.
and effective way, thanks to the unique capabilities of the human visual The visualizer will take in a pathfinding algorithm and input
system, which enables us to detect interesting features and patterns in data for example such as a map or a maze and will give the
short time. output as a visual representation of how the algorithm works.
The result is a web application built using HTML, CSS and The visualizer will be tested with a variety of different
JavaScript technologies. The application UI was able to visualize the pathfinding algorithms and input data.
Algorithm process using animation. There were even attempts to robotize RESULTS This poster concludes that visualizer can be
development of animated algorithms and algorithm visualization. achievable in near future in each and every algorithm
Path Finding Algorithms learning.

OBJECTIVES references
• Visualization : Visualization allows us to represent complex data in a
clear and intuitive way, making it easier to understand, analyze, and • “The Value of Visualization”, published by: Jarke J. van
communicate insights. Wijk, published in: October, 2005
• Finding the shortest path: The algorithm should find the path with the • “Algorithms Visualizer application”, published by:
smallest total cost or distance between the start and end points. Aditya, Shipra Srivastava, Gulshan Gupta, Bilal Ibrahim,
• Optimizing performance: The algorithm should run efficiently and be Jatin Kumar, published on: April 4th, 2022.
able to handle large and complex graphs. • “Visualization Sorting Algorithm”, published by: Brian
• Avoiding obstacles: The algorithm should be able to avoid obstacles or Faria, published in: June, 2017
other restrictions in the graph, such as walls or blocked paths. • “Sorting algorithm visualizer”, published by: Shubham
• Providing multiple paths: The algorithm may also provide multiple Nath, Jatin Gupta, Abhinav Gupta, Teena Verma
paths with similar costs, to give the user options for reaching their • “Sorting Algorithm Visualization”, published by:
destination. Bikram Karki, published on: November, 2021