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

Consider merging tree and graph search and normal and bidirectional search #4

Open
cmaclell opened this issue Feb 24, 2018 · 0 comments

Comments

@cmaclell
Copy link
Owner

Currently there are four base search functions:

  • tree_search
  • bidirectional_tree_search
  • graph_search
  • bidirectional_graph_search

I believe these can all be merged into a single function, with the aim of reducing redundant code, so any speed ups impact all search algorithms and to eliminate any bugs.

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

No branches or pull requests

1 participant