Verified curriculum practice

Graph-traversal answer explanations

Review worked answers and explanations for Graph-traversal. Aligned to AQA A Level Computer Science.

7

Questions

7

Supported

Review

Mode

Fundamentals

Topic

Answer explanations

Question 1 of 7

Review the answer support, then move sideways through the set.

0 of 5 attempted

Question 1

A breadth-first search starts at A. The neighbours of each vertex are considered in the order shown: A: B, C; B: D; C: E; D: none; E: none. In what order are the vertices visited?