Skip to content
Open Model LabInteractive concept
HomeConcept libraryComputer ScienceAlgorithms and SearchAlgorithms and Search Foundations
Computer ScienceAlgorithms and SearchIntroStarter track

Concept module

Breadth-First Search and Layered Frontiers

Keep the queue frontier, visited count, and graph layers visible together so breadth-first search reads as a layered process instead of a procedure list.

Interactive lab

Loading the live simulation bench.

Progress

Not startedMastery: NewLocal-first

Start exploring and Open Model Lab will keep this concept's progress on this browser first. No finished quick test, solved challenge, or completion mark is saved yet.

Let the live model runChange one real controlOpen What to notice

Try this setup

Jump to a named bench state or copy the one you are looking at now. Shared links reopen the same controls, graph, overlays, and compare context.

Featured setups

Layered campus BFS

Use a graph where the next layer fills in cleanly from left to right.

Hub and detours BFS

Start from the center so the queue widens before it narrows again.

Saved setups

Premium keeps named exact-state study setups in your account while stable concept links stay public below.

Checking saved setup access.

This concept can keep using stable links while the saved-setups capability resolves for this browser.

Copy current setup

Stable concept and section links stay public below while exact-state setup sharing stays behind premium.

Stable links

Starter track

Step 4 of 60 / 6 complete

Algorithms and Search Foundations

Earlier steps still set up Breadth-First Search and Layered Frontiers.

1. Sorting and Algorithmic Trade-offs2. Binary Search / Halving the Search Space3. Graph Representation and Adjacency Intuition4. Breadth-First Search and Layered Frontiers+2 more steps

Previous step: Graph Representation and Adjacency Intuition.

Start from track beginning

Why it behaves this way

Explanation

Breadth-first search keeps the frontier organized like a queue. The oldest claimed node gets expanded next, so the search spreads outward in visible layers instead of diving down one branch immediately.

On this bench the graph, the queue frontier, and the visited count stay coupled. That makes the layered shape of BFS honest: nearby nodes get settled first because the queue keeps earlier discoveries ahead of later ones.

Key ideas

01Breadth-first search expands the oldest waiting node first.
02On an unweighted graph, breadth-first layers match the fewest-edge distance from the start.
03The queue frontier grows when a node discovers new neighbors and shrinks when those waiting nodes get expanded.

Frozen walkthrough

Step through the frozen example

Frozen walkthrough
Read the queue frontier directly from the layered-campus bench.

Premium unlocks saved study tools, exact-state sharing, and the richer review surfaces that support this guided flow.

View plans
Frozen valuesUsing frozen parameters

On the layered campus graph, what should BFS settle first from A?

Graph layout

Layered campus

Start node

A

Queue frontier

B then C

1. Read the first layer

Starting from A, the first neighbors B and C become the first queue frontier.

2. Keep the queue order honest

Because BFS uses a queue frontier, B should leave the frontier before the later discovery C.

3. Read what that means

That oldest-first rule makes the search finish the shallow layer before it moves into deeper nodes like D, E, F, and H.

BFS layer read

From A, BFS settles the B/C layer before it pushes deeper.
The queue frontier is what turns a graph traversal into a layered search rather than a branch-first dive.

Common misconception

Breadth-first search just means moving around the page in a wide-looking pattern.

The important rule is not the drawing. The important rule is that the oldest claimed node leaves the frontier next.

That queue rule is what makes BFS settle the graph layer by layer.

Mini challenge

Build a BFS case where the frontier gets wide before the target is reached.

Make a prediction before you reveal the next step.

Decide whether you need an edge start or a hub start before you switch presets.

Check your reasoning against the live bench.

Use a hub-like start so BFS can claim several same-depth neighbors before it narrows again.
Breadth-first search widens fastest when one node has several direct neighbors at the same shallow depth.

Quick test

Reasoning

Question 1 of 2

Answer from the visible queue and depth pattern, not from memorized acronyms.

Why does BFS discover shallow nodes before deeper ones on this bench?

Use the live bench to test the result before moving on.

Accessibility

The simulation shows one labeled graph with the current node, the queue frontier, and the visited nodes colored differently so the BFS layers stay readable.

A readout card reports the traversal mode, current node, frontier size, visited count, and target, while a cue panel shows the frontier order and the current neighbor list.

Graph summary

One graph tracks visited nodes against frontier size, a second tracks current depth against the deepest claimed depth, and a third compares new discoveries with repeat skips.

Together they show how breadth-first search widens and then settles the graph layer by layer.