Computer scienceAlgorithms and Data StructuresAlgorithmsGraph algorithmsGraph search algorithms

Depth-first search

Time complexity

Report a typo

For a graph $G = (V, E)$ , the time complexity of the depth-first search procedure is ...

Select one option from the list

O(|V| + \sqrt{|V|})

O(|E| + \sqrt{|E|})

O(|V|^{1.5})

O(|V| + |E|)

___

Create a free account to access the full topic