depth-first search

(graph theory) 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.