logo

Study resource

Graph-traversal key terms

Study Graph-traversal with curriculum-aligned Key Terms resources, practice links, and exam-focused support.

At a glance

key terms

Resource type

Topic

Graph-traversal

AqaA LevelComputer ScienceFundamentals of algorithms

Key terms

  • Breadth-first search

    A graph-traversal algorithm that explores vertices level by level from a starting vertex; in an unweighted graph it can find a shortest path.

  • Depth-first search

    A graph-traversal algorithm that follows a branch as far as possible before backtracking; it can be used for navigating a maze.

Related topics

Study nearby topics next