Add A* (A-star) pathfinding algorithm with doctests and type hints#13780
Closed
umarprogrammer19 wants to merge 2 commits intoTheAlgorithms:masterfrom
Closed
Add A* (A-star) pathfinding algorithm with doctests and type hints#13780umarprogrammer19 wants to merge 2 commits intoTheAlgorithms:masterfrom
umarprogrammer19 wants to merge 2 commits intoTheAlgorithms:masterfrom
Conversation
Closing this pull request as invalid@umarprogrammer19, this pull request is being closed as none of the checkboxes have been marked. It is important that you go through the checklist and mark the ones relevant to this pull request. Please read the Contributing guidelines. If you're facing any problem on how to mark a checkbox, please read the following instructions:
NOTE: Only |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.This suggestion is invalid because no changes were made to the code.Suggestions cannot be applied while the pull request is closed.Suggestions cannot be applied while viewing a subset of changes.Only one suggestion per line can be applied in a batch.Add this suggestion to a batch that can be applied as a single commit.Applying suggestions on deleted lines is not supported.You must change the existing code in this line in order to create a valid suggestion.Outdated suggestions cannot be applied.This suggestion has been applied or marked resolved.Suggestions cannot be applied from pending reviews.Suggestions cannot be applied on multi-line comments.Suggestions cannot be applied while the pull request is queued to merge.Suggestion cannot be applied right now. Please check back later.
A* (A-star) pathfinding algorithm with doctests and type hints
This PR adds a pure-Python implementation of the A (A-star) pathfinding algorithm that works over arbitrary graphs via a neighbors(node) callback and an admissible heuristic h(node, goal). The module includes comprehensive docstrings, type hints, and doctests showing usage on a 4-connected grid with Manhattan distance. The implementation keeps state with g (cost-so-far), a min-heap priority queue for f = g + h, and reconstructs the path via a parent map.*
File added
searches/astar.py (all lowercase, no spaces or dashes)
Complexity
References
A* search algorithm — Wikipedia
Manhattan distance Taxicab geometry
Checklist
✅ I have read CONTRIBUTING.md
✅ This pull request is all my own work I have not plagiarized.
✅ I know that pull requests will not be merged if they fail the automated tests.
✅ This PR only changes one algorithm file. To ease review, I will open separate PRs for separate algorithms.
✅ All new Python files are placed inside an existing directory. (placed in searches/)
✅ All filenames are in all lowercase characters with no spaces or dashes.
✅ All functions and variable names follow Python naming conventions.
✅ All function parameters and return values are annotated with Python type hints.
✅ All functions have doctests that pass the automated testing.
✅ All new algorithms include at least one URL that points to Wikipedia or another similar explanation.
✅ If this pull request resolves one or more open issues, the description above includes the issue number(s) with a closing keyword: Fixes #ISSUE-NUMBER.