Glossary: Algorithms Beyond the Basics in Rust

BFS (breadth-first search)

Also written: breadth-first search, BFS

A graph search that spreads out from the start one road at a time, so it finds the route with the fewest roads. It ignores driving minutes, which is why Dijkstra's algorithm is needed.