Breadth-first search
Sorting algorithm
>
.png&imgrefurl=https://www.geeksforgeeks.org/difference-between-bfs-and-dfs/&h=501&w=1001&tbnid=pTncUUgz6wDbWM&q=Breadth-first+search&tbnh=75&tbnw=149&usg=AI4_-kSShS-b-xX7nQ-TffvuzkY5XgLpsw&vet=1&docid=EIYVNAjiLfghqM&sa=X&ved=2ahUKEwiH3o3dudCFAxVBjIkEHQ60D1sQ9QF6BAgAEAo)
Breadth-first search is an algorithm for searching a tree data structure for a node that satisfies a given property. It starts at the tree root and explores all nodes at the present depth prior to moving on to the nodes at the next depth level. Wikipedia
Worst-case complexity: O(|E|) = O(b^d)
Class: Search algorithm
Data structure: Graph