-
Notifications
You must be signed in to change notification settings - Fork 77
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
[Feature Request]: Implement A (A-Star) Algorithm #496
Comments
🙌 Thank you for bringing this issue to our attention! We appreciate your input and will investigate it as soon as possible. Feel free to join our community on Discord to discuss more! |
Hey @that-ar-guy can you please assign this issue to me under swoc2025 |
Hey @KYashnandan , we have to open our own issue, to be assigned by the maintainers, |
@that-ar-guy Got it , Thanks . |
@UTSAVS26 should i start working on it |
Is there an existing issue for this?
Feature Description
Currently, the repository includes Dijkstra’s algorithm for shortest path computation. To enhance pathfinding efficiency, we should implement the A (A-Star) Algorithm*, which optimizes pathfinding by incorporating heuristics.
Record
Full Name
MOHAMMED ABDUL RAHMAN
Participant Role
SWOC 5
The text was updated successfully, but these errors were encountered: