Breadth-first search

Breadth-first search (BFS) search inside a graph by first prioritising all the children nodes before moving to the next one.

Complexity

Time complexity

• Worst-case: $O(|V|+|E|)$
• Best-case: $\mathrm{\Omega }(1)$

Resources

• Breadth-first search visualization – David Galles
• Breadth-first search in 4 minutes – Youtube