The following is an algorithm for a(n) ____.
Mark the current vertex, u, visited and enter it in the discovery order list
For each vertex, v, adjacent to the current vertex, u
If v has not been visited
Set parent of v to u.
Recursively apply this algorithm starting at v.
Mark u finished and enter u into the finish order list.
A) breadth-first search
B) linear search
C) binary search
D) depth-first search

Question

Quizplus · Accepted Answer

This algorithm describes a depth-first search (DFS). DFS explores as far as possible along each branch before backtracking, which is indicated by the recursive application of the algorithm for each unvisited adjacent vertex and the use of discovery and finish order lists.

The Following Is an Algorithm for A(n) ____