depth-first search

Short definition from Wiktionary

Noun

1. 1
   An algorithm for traversing a tree or graph where one starts at the root and explores as far as possible along each branch before backtracking.