the search of a graph first visits a vertex, then it recursively visits all the vertices adjacent to that vertex. a. binary b. breadth-first c. linear d. depth-first