github.com/Tenire/AStar ↗
An animated time-lapse of how Tenire/AStar was built, commit by commit.
Open this visualization on its own page →
Contributors
2
Lines of Code
22
From
2020-12-18
To
2021-10-29
About Tenire/AStar
This is a Java implementation of the A* pathfinding algorithm presented as an interactive visual tool. The program displays a grid-based environment where users can designate an origin point (green node) and a destination (red node), then run the algorithm to find the shortest path between them. Users can also paint obstacles (black walls) on the grid to create more complex pathfinding scenarios.
The application provides an intuitive graphical interface for experimenting with A* search in real time. Left-clicking the green node initiates the pathfinding process, which visualizes the discovered route in cyan. The tool allows dynamic manipulation of the grid by adding or removing walls, changing the origin node with middle-mouse clicks, and selecting a new destination with right-clicks. A compiled JAR file is available for immediate use without needing to build from source.