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

FInd neighbours #112

Closed
sraaphorst opened this issue Jun 24, 2018 · 1 comment
Closed

FInd neighbours #112

sraaphorst opened this issue Jun 24, 2018 · 1 comment

Comments

@sraaphorst
Copy link
Owner

If we can implement, in the general case, an algorithm to return the neighbours of a given Cell in the maze, then we can program BFS as per #110 directly in AbstractMaze.

@sraaphorst
Copy link
Owner Author

This is done for Maze, GraphMaze, and ThickMaze, with test cases added for Maze and ThickMaze that helped me fix some errors and architectural shortcomings.

Still unsure about GraphMaze, as I may want to do something more with this class.

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

1 participant