Skip to content

Glossary: Algorithms Beyond the Basics in Go

BFS (breadth-first search)

Also written: breadth-first search, BFS

A graph search that visits places in order of how many roads they are from the start. It finds the route with the fewest roads, not the fewest minutes.

Where the book teaches it

Related terms

DFS (depth-first search)Shortest pathDijkstra's algorithm