Computer scienceAlgorithms and Data StructuresAlgorithmsGraph algorithmsGraph search algorithms

Breadth-first search

Time complexity

Report a typo

What is the time complexity of the BFS algorithm?

Select one option from the list

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

O(|V|+|E|)

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

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

___

Create a free account to access the full topic