Code + PPT + Video for the Breadth-first Search (BFS) Algorithm.
- BFS_Floodfill.java: Code for doing a BFS and changing squares of a certain color to a new color.
- DFS Floodfill.java
- DFS Island Counting
- BFS_Maze.java: Code for shortest path in a grid with walls.
- PPT
- Add starting point to the queue
- Iterate while the queue is not empty
- Remove top coordinate from queue
- If coordinate has been visited already: skip the below steps
- Set coordinate to visited
- Add all adjacent coordinates to the queue.