Skip to content
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

Open
4 tasks done
that-ar-guy opened this issue Feb 22, 2025 · 5 comments
Open
4 tasks done

[Feature Request]: Implement A (A-Star) Algorithm #496

that-ar-guy opened this issue Feb 22, 2025 · 5 comments

Comments

@that-ar-guy
Copy link
Contributor

Is there an existing issue for this?

  • I have searched the existing issues

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

  • I agree to follow this project's Code of Conduct
  • I want to work on this issue
  • I'm willing to provide further clarification or assistance if needed.

Full Name

MOHAMMED ABDUL RAHMAN

Participant Role

SWOC 5

Copy link
Contributor

🙌 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!

@KYashnandan
Copy link

Hey @that-ar-guy can you please assign this issue to me under swoc2025

@that-ar-guy
Copy link
Contributor Author

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,

@KYashnandan
Copy link

@that-ar-guy Got it , Thanks .

@that-ar-guy
Copy link
Contributor Author

@UTSAVS26 should i start working on it

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

No branches or pull requests

2 participants