ALGORITHM READING NOTE

Graph Breadth-First Search

BFS explores a graph level by level using a queue. In an unweighted graph it finds shortest paths by number of edges.

TYPEAlgorithmCATEGORYGraphsDEPTHBeginnerTYPICAL COMPLEXITYO(V+E)

SHORT INTERVIEW ANSWER

Start with this mental model

BFS explores a graph level by level using a queue. In an unweighted graph it finds shortest paths by number of edges.

SIMPLE EXPLANATION

How it works, without unnecessary jargon

Enqueue the start and mark it visited.

Repeatedly dequeue one node and enqueue unseen neighbors.

EXECUTION

Read the algorithm as a sequence of decisions

Define directed/undirected and weighted/unweighted assumptions.

Choose the graph representation.

Track algorithm state and handle disconnected/cyclic cases explicitly.

A small example to keep in mind

Read a tiny input by hand and write down the state after every important operation. For Graph Breadth-First Search, the goal is to make the invariant visible rather than to memorize code.

READABLE JAVASCRIPT IMPLEMENTATIONJavaScript

function bfs(graph, start) {
  const seen = new Set([start]);
  const queue = [start];
  let head = 0;
  while (head < queue.length) {
    const node = queue[head++];
    for (const next of graph[node] ?? []) {
      if (!seen.has(next)) {
        seen.add(next);
        queue.push(next);
      }
    }
  }
  return seen;
}

How to read this code

Do not memorize the syntax. Follow the state that changes on each line and connect it to the invariant described above.

COMPLEXITY

O(V+E)

Do not quote this complexity mechanically. Ask which operation or input dimension it describes, then derive the cost from the loops, recursion depth, data-structure operations and any preprocessing assumptions.

WHEN TO USE IT

Good fit

Use the algorithm only when its graph assumptions match the problem.

COMMON MISTAKES

What usually goes wrong

Forgetting disconnected components.
Mixing weighted and unweighted shortest-path algorithms.
Not protecting against revisits/cycles.

HOW TO EXPLAIN IT IN AN INTERVIEW

A professional answer shape

The queue is not an implementation detail—it creates level order, which is exactly why unweighted shortest paths work.

Problem→Core idea→Invariant / state→Big-O→Trade-off

QUICK INTERVIEW CHECK

What problem does Graph Breadth-First Search solve?

BFS explores a graph level by level using a queue. In an unweighted graph it finds shortest paths by number of edges.

What should I mention about complexity?

Its typical cost here is O(V+E), but a complete answer should connect that cost to the representation, input constraints and the dominant operations.

What is the most common mistake?

Forgetting disconnected components.

Continue readingGraph representationDFS/BFSPriority queues

function bfs(graph, start) { const seen = new Set([start]); const queue = [start]; let head = 0; while (head < queue.length) { const node = queue[head++]; for (const next of graph[node] ?? []) { if (!seen.has(next)) { seen.add(next); queue.push(next); } } } return seen; }