Path-Finding-Visualizer
Purpose
This is a tool to visualize search algorithms
Algorithms featured
- Breadth First Search
- Deapth First Search
- Gready Best First Search
- A* Search
Functionality
- Move the starting node
- Move the target node
- Place a wall
- Erase a wall
- Allow Diagonial moves
- Adjust Grid size
- Adjust Delay
- Choose Algorithm
- Generate random maze
- Reset the whole grid
- Reset only the path
How to use
- Starting node: Drag and move around with left click
- Target node: Drag and move around with left click
- Place wall: Drag or press empty cells with left click
- Erase wall: Drag or press wall cells with right click
- Generate maze: Press the generate button
- Reset grid: You can reset the grid anytime
- Reset path: You can only reset the path when the algorithm is done
- Visualize: Press the visualize button
Preview
Path Finding
Random maze
Diagonial moves
Instalation
git clone https://github.com/Leonardpepa/Path-Finding-Visualizer.git
cd Path-Finding-Visualizer
Execution
- 1st way: Run the Path Finding Visualizer.jar
- 2nd way: Run from source code via Main.java