sraaphorst/spelunker

Implement BFS

Closed this issue · 1 comments

sraaphorst commented

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 commented

Accidentally made this change in master in:
87568f8