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.

Sign up for GitHub

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

Jump to bottom

Implement BFS #110

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

Implement BFS #110

sraaphorst opened this issue Jun 24, 2018 · 1 comment

Comments

@sraaphorst
Copy link
Owner

We need to implement BFS for each maze type (but abstractly defined in AbstractMaze).

  • Input: A cell.
  • Output: A list of cells visited and their distances.

This will allow us to implement #108 and #109 with ease, and probably reuse this information in order to:

  1. Draw the BFS as it is being done (using different colours to indicate the connected components), which would be awesome from a UI perspective.
  2. Generalize solutions to AbstractMaze instead of to Maze and ThickMaze independently.
@sraaphorst sraaphorst mentioned this issue Jun 24, 2018
Closed
@sraaphorst
Copy link
Owner Author

Accidentally made this change in master in:
87568f8

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Assignees
No one assigned
Labels
None yet
Projects
None yet
Milestone
No milestone
Development

No branches or pull requests
1 participant
@sraaphorst