Breadth First Search

Definition

An algorithm that explores a graph layer by layer, expanding equally in all directions. It guarantees finding the shortest path in an unweighted graph. Requires a Queue and a 'visited' Set.

Explain Like I'm New

Throwing a rock in a pond and watching the ripples expand outward evenly in a circle.

Interactive Coding Challenges

Rotting Oranges

Solution Code

Console output will appear here...