[1] : The Free On-line Dictionary of Computing (27 SEP 03)

depth-first search
     
         a graph search algorithm which extends the
        current path as far as possible before backtracking to the
        last choice point and trying the next alternative path.
        depth-first search may fail to find a solution if it enters a
        cycle in the graph.  this can be avoided if we never extend a
        path to a node which it already contains.
     
        opposite of breadth first search.  see also iterative
        deepening.
     
        1995-04-19
     
     
see also:
algorithm backtracking choice point breadth first search iterative deepening 

Search >> S Words
Search, definition of term: Search
search_pag1.html

Search Warrant >> S Words
Search Warrant, definition of term: Search Warrant
search+warrant_pag1.html

Search Engine >> S Words
Search Engine, definition of term: Search Engine
search+engine_pag1.html

Search Party >> S Words
Search Party, definition of term: Search Party
search+party_pag1.html