https://github.com/leonardpepa/pathfinding-visualizer

Pathfinding Visualizer application that visualizes graph based search algorithms used to find the shortest path. Algorithms used: Breadth first search, Depth first search, Best first search and A* search made with java swing
https://github.com/leonardpepa/pathfinding-visualizer

astar astar-algorithm astar-pathfinding astar-search-algorithm best-first-search bfs breadth-first-search depth-first-search dfs dsa-algorithm java leonard leonardpepa pathfinder pathfinding pepa shortest-path-algorithm shortest-paths visualization visualizer

Last synced: 2 months ago
JSON representation

Pathfinding Visualizer application that visualizes graph based search algorithms used to find the shortest path. Algorithms used: Breadth first search, Depth first search, Best first search and A* search made with java swing

• Host: GitHub
• URL: https://github.com/leonardpepa/pathfinding-visualizer
• Owner: Leonardpepa
• Created: 2022-01-18T14:18:20.000Z (over 3 years ago)
• Default Branch: master
• Last Pushed: 2022-02-02T23:48:26.000Z (about 3 years ago)
• Last Synced: 2025-02-02T02:11:46.083Z (3 months ago)
• Topics: astar, astar-algorithm, astar-pathfinding, astar-search-algorithm, best-first-search, bfs, breadth-first-search, depth-first-search, dfs, dsa-algorithm, java, leonard, leonardpepa, pathfinder, pathfinding, pepa, shortest-path-algorithm, shortest-paths, visualization, visualizer
• Language: Java
• Homepage: https://github.com/Leonardpepa/Path-Finding-Visualizer
• Size: 521 KB
• Stars: 23
• Watchers: 2
• Forks: 10
• Open Issues: 0
• Metadata Files:
  • Readme: README.md

Awesome Lists containing this project

README

        
# 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

* Pause/Resume the proccess

# 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

* Pause/Resume: press space to pause or resume the proccess

* Visualize: Press the visualize button

## Preview

![preview-image](https://github.com/Leonardpepa/Path-Finding-Visualizer/blob/master/screenshots/screenshot1.JPG)

### Path Finding

![preview-image](https://github.com/Leonardpepa/Path-Finding-Visualizer/blob/master/screenshots/screenshot2.JPG)

### Random maze

![preview-image](https://github.com/Leonardpepa/Path-Finding-Visualizer/blob/master/screenshots/screenshot3.JPG)

### Diagonial moves

![preview-image](https://github.com/Leonardpepa/Path-Finding-Visualizer/blob/master/screenshots/screenshot4.JPG)

### Pause state

![preview-image](https://github.com/Leonardpepa/Path-Finding-Visualizer/blob/master/screenshots/screenshot5.JPG)

# Instalation

```terminal

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