Study resource
Graph-traversal common mistakes
Study Graph-traversal with curriculum-aligned Common Mistakes resources, practice links, and exam-focused support.
At a glance
common mistakes
Resource type
Topic
Graph-traversal
AqaA LevelComputer ScienceFundamentals of algorithms
Common mistakes
Confusing the two traversal patterns
Describing depth-first search as visiting all nearby vertices before going deeper, or claiming that depth-first search always gives a shortest path in an unweighted graph.
Fix itRemember that breadth-first search explores level by level and is used for shortest paths in unweighted graphs. Depth-first search explores one branch deeply and is used for navigating a maze.
Related topics