If a person chooses to go from one city to another, they may face several challenges, including increased traffic due to population growth, obstructed routes, and inefficient time management. Because determining a path between nodes or cities is a time-consuming task, pathfinding algorithms can make it easier. Pathfinding algorithms aid in the discovery of the shortest route between a source and a destination node. The Pathfinding Visualizer tool uses Dijkstra's Algorithm, one of the Pathfinding algorithms, to discover the shortest path between any two places. This paper examines some of the issues with pathfinding techniques that do not rely on algorithms. The paper then offers a system that seeks to address the flaw. User Interaction is the system's main focus. To put it another way, the goal of this paper is to give a basic understanding of how a pathfinding algorithm works and how a shortest path is formed.