https://github.com/giridharrnair/a-star-algorithm-visualizer
A* algorithm visualizer in Java using the Java Swing framework
https://github.com/giridharrnair/a-star-algorithm-visualizer
astar-algorithm java javaswing
Last synced: 23 days ago
JSON representation
A* algorithm visualizer in Java using the Java Swing framework
- Host: GitHub
- URL: https://github.com/giridharrnair/a-star-algorithm-visualizer
- Owner: GiridharRNair
- License: mit
- Created: 2023-05-10T03:55:08.000Z (almost 2 years ago)
- Default Branch: main
- Last Pushed: 2025-02-26T18:51:56.000Z (2 months ago)
- Last Synced: 2025-03-27T14:52:46.732Z (about 1 month ago)
- Topics: astar-algorithm, java, javaswing
- Language: Java
- Homepage:
- Size: 22 MB
- Stars: 1
- Watchers: 1
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
- License: LICENSE
Awesome Lists containing this project
README
# A* Algorithm Visualizer
## Introduction
A * algorithm is a searching algorithm that searches for the shortest path between the initial and the final state.
The algorithm used in various applications, such as maps, in which the A* algorithm calculates the shortest distance
between the source (initial state) and the destination (final state).
https://www.educative.io/answers/what-is-the-a-star-algorithm
## Features
- Interactive grid-based environment
- Place obstacles on the grid
- Visualize the A* algorithm in action
- Pause and resume the visualization
- Modify the iteration speed
- See optimal path highlighted
## Prerequisites
- Java Development Kit (JDK) installed
- Java Swing library
## Running The Program Through Command Line (Double Click Alternative)
1. Download AStarVisualizer.jar from this repository's releases.
2. In the terminal, enter the directory where the AStarVisualizer.jar is downloaded.
For example, all my downloaded files are inside the downloads folder, so I would enter the downloads directory.
``` bash
cd downloads
```
3. Then run the command below to run the AStarVisualizer.jar file.
``` bash
java -jar AStarVisualizer.jar
```
## License
This project is licensed under the MIT License. Feel free to use and modify the code for your own purposes.
