Computer scienceAlgorithms and Data StructuresAlgorithmsGraph algorithmsGraph search algorithms

Depth-first search

Correct description

Report a typo

Which of the following statements correctly describes the depth-first search procedure?

Select one option from the list

Choose an arbitrary node of a graph, then visit all its neighbours that were not visited previously.

Choose two nodes of a graph and recursively visit the nodes of the first one until the second node is reached.

Choose an arbitrary node of a graph, then recursively traverse all its unvisited neighbours. Repeat until all the nodes are visited.

Choose an arbitrary node of a graph and recursively traverse all its neighbours until one of the already visited neighbours is reached.

___

Create a free account to access the full topic