Pathfinding Visualizer of Shortest Path Algorithms

Authors

  • Enosh Raj Paul Computer Engineering Department St. Vincent Pallotti College of Engineering And Technology, Nagpur
  • Harsh Rohit Upadhyay Computer Engineering Department St. Vincent Pallotti College of Engineering And Technology, Nagpur
  • Korlapu Abhishek Computer Engineering Department St. Vincent Pallotti College of Engineering And Technology, Nagpur
  • Ritesh Virulkar Computer Engineering Department St. Vincent Pallotti College of Engineering And Technology, Nagpur

Keywords:

Visualization, algorithm, shortest route, pathfinding

Abstract

The visibility of algorithms contributes to the development of computer science education. The process of teaching and learning algorithms is often complex and difficult to understand. Visualization is a useful way to learn in any computer science course. In this paper an e-learning tool for short algorithms presentation techniques is described. The advanced e-learning tool allows you to create, edit and maintain graph formats and visualize action algorithm steps. It is intended to be used as a face-to-face supplement or as a stand-alone application. The intellectual functionality of the defined e-learning tool is demonstrated through the use of the path finding algorithms. Preliminary test results demonstrate the usefulness of the e-learning tool and its ability to assist students in developing effective mental models related to short-term algorithms. This electronic learning tool is intended to combine different algorithms to get the shortest route.

References

International Journal for Modern Trends in Science and Technology, 6(12): 479-483, 2020 Copyright © 2020 International Journal for Modern Trends in Science and Technology ISSN: 2455-3778 online DOI: https://doi.org/10.46501/IJMTST061293 Available online at: http://www.ijmtst.com/vol6issue12.html 2.IACSIT International Journal of Engineering and technology, Vol. 5, No. 4, August 2013.

A Review on Algorithms for Pathfinding inComputer Games Parth Mehta1 Hetasha Shah2 Soumya Shukla3 Saurav Verma4 Student1,2,3, Assistant Professor4 MPSTME NMIMS, Mumbai parth94@hotmail.com, hetasha94@gmail.com, soumyashukla1094@gmail.com, sauravtheleo@gmail.com

Comparative Analysis of Path-finding Algorithm on Unrestricted Virtual Object Movable for Augmented Reality by Aninditya Anggari Nuryono, Alfian Ma’arif, Iswanto Iswanto.

PATHFINDING VISUALIZER subtitle Thierry Thierry Oke Department, Minnesota State University Moorhead, 1104 7th Avenue South, Moorhead, MN 56563.

Zhang He School of Computer Science Communication University of China Beijing, China 13207144228@163.com

The Hong Kong Polytechnic University; betty-tong.pan@connect.polyu.hk

The Hong Kong Polytechnic University; lilian.pun@polyu.edu.hk

A Path Finding Visualization Using

A Star Algorithm and Dijkstra’s Algorithm Saif Ulla Shariff1, M Ganeshan2

Master of Computer Application,

Associate Professor, Jain Deemed-to-be University, Bengaluru, Karnataka, India.

5th International Conference on Computer Science and Computational Intelligence 2020, A Systematic Literature Review of A* Pathfinding Daniel Foeada , Alifio Ghifaria, Marchel Budi Kusumaa, Novita Hanafiahb, Eric Gunawan.

Downloads

Published

18-04-2022

How to Cite

Enosh Raj Paul, Harsh Rohit Upadhyay, Korlapu Abhishek, & Ritesh Virulkar. (2022). Pathfinding Visualizer of Shortest Path Algorithms. International Journal for Research Publication and Seminar, 13(3), 171–178. Retrieved from https://jrps.shodhsagar.com/index.php/j/article/view/552

Issue

Section

Original Research Article