noun
depth-first search
A graph traversal algorithm used in computing; explores as far as possible along each branch before backtracking.
深さ優先探索は、迷路を解くのによく使われる。
Depth-first search is often used to solve mazes.
Breadth-first search; explores all neighbors at the present depth before moving deeper, unlike depth-first search which goes deep first.
Compound of 深さ (depth), 優先 (priority), and 探索 (search). A direct translation of the English computing term 'depth-first search'.