Breadth-First Search
Concept
An algorithm for traversing or searching tree or graph data structures, which explores all nodes at the present depth prior to moving on to nodes at any greater depth. It was the initial approach before Dijkstra's improvements.
Mentioned in 1 video
