Repository navigation
Conversation
There was a problem hiding this comment.
Click here to look at the relevant links ⬇️
🔗 Relevant Links
Repository:
Python:
Automated review generated by algorithms-keeper. If there's any problem regarding this review, please open an issue about it.
algorithms-keeper commands and options
algorithms-keeper actions can be triggered by commenting on this PR:
@algorithms-keeper reviewto trigger the checks for only added pull request files@algorithms-keeper review-allto trigger the checks for all the pull request files, including the modified files. As we cannot post review comments on lines not part of the diff, this command will post all the messages in one comment.NOTE: Commands are in beta and so this feature is restricted only to a member or owner of the organization.
| from itertools import count, pairwise | ||
| from math import hypot, inf | ||
|
|
||
| Point = tuple[int, int] |
There was a problem hiding this comment.
Variable and function names should follow the snake_case naming convention. Please update the following name accordingly: Point
| self.cells = rows | ||
| self.height, self.width = len(rows), len(rows[0]) | ||
|
|
||
| def blocked(self, x: int, y: int) -> bool: |
There was a problem hiding this comment.
Please provide descriptive name for the parameter: x
Please provide descriptive name for the parameter: y
| and any(not self.blocked(cx, cy) for cx in (x - 1, x) for cy in (y - 1, y)) | ||
| ) | ||
|
|
||
| def line_of_sight(self, a: Point, b: Point) -> bool: |
There was a problem hiding this comment.
Please provide descriptive name for the parameter: a
Please provide descriptive name for the parameter: b
| return [q for q in candidates if q != point and self.line_of_sight(point, q)] | ||
|
|
||
|
|
||
| def distance(a: Point, b: Point) -> float: |
There was a problem hiding this comment.
Please provide descriptive name for the parameter: a
Please provide descriptive name for the parameter: b
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.
Describe your change
This PR adds Basic Theta* for obstacle grids with paths through cell corners. The search follows the parent-shortcut update from Nash et al. (2007). It includes grid validation, line-of-sight checks, logging and doctest examples. The diff has exactly two new files:
graphs/theta_star.py(the algorithm) andgraphs/tests/test_theta_star.py(separate tests). It contains no AP Theta* or performance cache.Local checks: 26 pytest cases passed; doctests passed; Ruff check and format check passed. The full repository suite is left to CI.
Checklist