Depth-first Search - Formal Definition

Formal Definition

Formally, DFS is an uninformed search that progresses by expanding the first child node of the search tree that appears and thus going deeper and deeper until a goal node is found, or until it hits a node that has no children. Then the search backtracks, returning to the most recent node it hasn't finished exploring. In a non-recursive implementation, all freshly expanded nodes are added to a stack for exploration.

Read more about this topic:  Depth-first Search

Famous quotes containing the words formal and/or definition:

    On every formal visit a child ought to be of the party, by way of provision for discourse.
    Jane Austen (1775–1817)

    It’s a rare parent who can see his or her child clearly and objectively. At a school board meeting I attended . . . the only definition of a gifted child on which everyone in the audience could agree was “mine.”
    Jane Adams (20th century)