-
-
Notifications
You must be signed in to change notification settings - Fork 50k
Added AO* algorithm #13823
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
base: master
Are you sure you want to change the base?
Added AO* algorithm #13823
Conversation
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
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 typing import Any | ||
|
|
||
|
|
||
| def _update_node( |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
As there is no test file in this pull request nor any test function or class in the file machine_learning/ao_star.py, please provide doctest for the function _update_node
| def _update_node( | ||
| graph: dict[Any, list[list[Any]]], | ||
| node: Any, | ||
| h: dict[Any, float], |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
Please provide descriptive name for the parameter: h
| solved[node] = best_option | ||
|
|
||
|
|
||
| def _ao_star( |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
As there is no test file in this pull request nor any test function or class in the file machine_learning/ao_star.py, please provide doctest for the function _ao_star
| def _ao_star( | ||
| graph: dict[Any, list[list[Any]]], | ||
| node: Any, | ||
| h: dict[Any, float], |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
Please provide descriptive name for the parameter: h
| def ao_star( | ||
| graph: dict[Any, list[list[Any]]], | ||
| start: Any, | ||
| h: dict[Any, float], |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
Please provide descriptive name for the parameter: h
Describe your change:
This pull request introduces a new implementation of the AO* (And-Or Star) search algorithm for solving AND-OR graphs in the
machine_learning/ao_star.pyfile. The AO* algorithm is useful for problems where nodes can represent both OR decisions and AND decompositions, generalizing standard search trees. The implementation includes documentation, type hints, and several usage examples, making it easy to understand and use.New AO* Algorithm Implementation
machine_learning/ao_star.py, including helper functions for node updates and recursive solving.ao_starfunction, demonstrating how to construct AND-OR graphs and apply the algorithm.__main__block, allowing users to run and observe the algorithm's output directly.Checklist: