Welcome to the Pathfinding Visualizer! This project offers an interactive way to explore various pathfinding algorithms through a web-based visualizer. You can experiment with different algorithms to see how they navigate a grid and find paths from a source to a target.
Explore the live version of the Pathfinding Visualizer here: Pathfinding Visualizer
🔊 unmute the video for the full experience!
pathfinding.visualizer.1.1.mp4
- Interactive Grid: Draw walls and set start/end points by dragging on the grid. 🖱️
- Algorithm Visualization: Visualize pathfinding algorithms in real-time. 🔍
- Algorithm Options: Choose from a variety of algorithms including:
- Breadth-First Search (BFS) 🌊
- Depth-First Search (DFS) 🌲
- AStar Search ⭐
- Bidirectional Search 🔄
- Dijkstra's Algorithm 📏
- Greedy Best-First Search 🧠
- Pathfinding Controls: Start, pause, and reset the visualizer. 🎛️
- Customization: Change grid size, clear paths, and reset the board. ⚙️
- Recursive Maze Generation: Generate random mazes for pathfinding practice. 🌀
- Wall Drawing: Easily draw walls to create obstacles on the grid. 🏗️
- Drag and Drop: Set source and target points by dragging. 🖱️
- Grid Size Adjustment: Dynamically change the grid size to fit your needs. 📏
- Path and Board Clearing: Clear paths and reset the board with ease. 🧹
The Pathfinding Visualizer was developed as a self-contained JavaScript application. It involves implementing several pathfinding algorithms and creating an intuitive UI for users to interact with.
Plans for future updates include:
- Adding more pathfinding algorithms. 🔍
- Enhancing user interface and experience. 🎨
- Improving performance and functionality. ⚡
Contributions are welcome!
This project is licensed under the MIT License. See the LICENSE file for details.
Got feedback, suggestions, or just want to say hi? Reach out to me:
- Email: [email protected]
- LinkedIn: Connect with me on LinkedIn