ITPEC Textbook
Reading settings
Theme

Guest settings stay on this device. Sign in to sync reader settings.

Contents
Chapter 7 · Data Structure and AlgorithmPractice
← Return to textbook

CONCEPT PRACTICE

Depth-first graph search and backtracking

1 related published questions. Take them one at a time.

Filter questions
Question sources

1 of 1 questions match.

ITPEC Practice
0/1 answered

Question 1 of 1

0/1 answered

2025 Spring · Subject A · Q6

Original exam question · Select the image to enlarge
Read the question as text

Q6. In the graph shown below, which of the following is the output of a depth-first traversal starting from vertex A, and visiting all vertices in ascending character order? A B E F D C Diagram/table transcription: The original undirected graph has edges A-B, B-C, B-D, C-F, D-F and D-E.

The original image above preserves the complete exam wording and layout.

Choose your answer
Choose an option to check your answer.
1 / 1Back to lesson →

Source: 2025S_FE-A_Questions.pdf, PDF page 6. ID: 2025S-A-Q006. Explanation written for this textbook.

Original question · Q6
Q6. In the graph shown below, which of the following is the output of a depth-first traversal starting from vertex A, and visiting all vertices in ascending character order? A B E F D C Diagram/table transcription: The original undirected graph has edges A-B, B-C, B-D, C-F, D-F and D-E.

Scroll horizontally to read the image at full size.

Figure

Open original ↗