Tenire/AStar ↗
Created May 11, 2022 · View the Tenire/AStar repository page
An animated visualization of Tenire/AStar's Git history from December 2020 to October 2021, built by 2 contributors. The codebase reached 22 lines, mostly Java. The video runs 12 seconds.
Want this for your repo?
Render a free sample of any GitHub repo in seconds.
Contributors
2
Lines of Code
22
From
Dec 18, 2020
To
Oct 29, 2021
Advertisement
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.
Advertisement
