powered by v43.ai像艺术家一样学解剖
中文
Class 9 · DSA · Enrichment

Depth-first search

Interactive explanation Gamified quiz, feedback & rewards

0 XP0 mastered
DSA enrichment · Learning goals & preparation

By the end, you can…

  • Explain The recursive stack remembers where to resume after a branch.
  • Trace a small input and connect each operation to the algorithm’s rule.
  • Explain the implementation’s time and space cost and solve its mission.

Useful preparation: Reading arrays, indexing from zero and following step-by-step instructions. Suggested previous stop: Breadth-first search.

DSA uses suggested Foundation (Class 8), Builder (Class 9) and Advanced (Class 10) levels. It is an enrichment pathway.

Graphs · Builder

Depth-first search

012345

Ready. Step through the algorithm and explain each change.

  1. visit and mark source
  2. for each neighbour
  3. if not visited: DFS(neighbour)
  4. return when all neighbours are explored

Example: 6 vertices, unweighted edges

A small fixed example keeps the mechanics easy to inspect.

A deliberate practice loop

Don’t just watch it move

  1. 1Before stepping, predict the next comparison, pointer move or state update.
  2. 2Read the explanation and identify the invariant that remains true.
  3. 3Change the input, then solve the concept quest without guessing.
About this pathway

From foundations to advanced patterns

The library covers core DSA techniques with bounded teaching examples. Foundation, Builder and Advanced describe learning progression, rather than a school-class syllabus. Snapshots are stored for playback and are excluded from algorithm-space labels.

Further study: MIT Introduction to Algorithms ↗