A graph-traversal algorithm stops when ______.
A)it first encounters the designated destination vertex
B)it has visited all the vertices that it can reach
C)it has visited all the vertices
D)it has visited all the vertices and has returned to the vertex that it started from

Question

Quizplus · Accepted Answer

A graph-traversal algorithm stops when it has visited all the vertices that it can reach. It may not necessarily have visited all the vertices in the graph, but it has explored all the vertices that are connected to the starting vertex through a path.

A Graph-Traversal Algorithm Stops When ______