Glossary: Algorithms Beyond the Basics in Go

DFS (depth-first search)

Also written: DFS, depth-first search

A graph or tree search that follows one path as far as it can before backing up. Backtracking walks its choice tree this way.