The DICT Development Group
1 definition found
for depth-first search
From The Free On-line Dictionary of Computing (30 December 2018) :
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
Contactfirstname.lastname@example.org Specification=RFC 2229