Glossary: Data Structures and Algorithms

Breadth-first search (BFS)

Also written: BFS, breadth-first search

A way to explore a graph ring by ring from a start place, using a queue and a visited set. Because it reaches each place by the fewest roads first, it finds the fewest-stop route.