Comparing the Iterative and Recursive Flood Fill Algorithms

Initializing live version
Download to Desktop

Requires a Wolfram Notebook System

Interact on desktop, mobile and cloud with the free Wolfram Player or other Wolfram Language products.

This Demonstration compares the iterative and recursive Flood Fill algorithm. The recursive algorithm searches for a blank cell in four directions (north, west, south, east), then fills that cell, and continues to look for another blank cell in the same four directions. It will always search for north, west, south, east in that order. For example, if both west and south are available, it will fill the west cell. Finally, if all compass directions are filled, then it will go back to the previous cell it was at and start filling if there are any cell in the compass direction that are not filled. The iterative algorithm looks for a blank cell in two directions (south and north), fills the blank cell, and adds the blank cells that are to the west or east of it to a queue. Then while the queue is not empty, the step is repeated. The white cells represent blank cells, blue cells represent filled cells, and black cells represent obstacles.

Contributed by: Andrew Yang (January 2014)
Open content licensed under CC BY-NC-SA




Feedback (field required)
Email (field required) Name
Occupation Organization
Note: Your message & contact information may be shared with the author of any specific Demonstration for which you give feedback.