BFS Simulation

Rotten Oranges

Watch how corruption spreads through a grid. This is a Multi-source Breadth-First Search (BFS) problem, where multiple "rotten" sources contaminate adjacent fresh cells simultaneously.

Time ComplexityO(M × N)

AlgorithmMulti-BFS

Try Interactive Simulator

Time Propagation

Every minute, the rot spreads 1 unit distance in all 4 directions. BFS ensures we find the earliest possible time for each orange to rot.

Source Management

We initialize a queue with all initially rotten oranges. This allows them to "race" outwards simultaneously, calculating the global time.

🤢

🍊

🤢

🖱️ Click cells to edit grid configuration

Loading Lab...