DFS (depth-first search)

Also written: DFS

A search that follows one path as deep as it can before backing up, usually written as recursion. It is used for tasks such as flood fill on a grid.