(algorithm) | 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. |

Browse

Deprivation

Deprive

deprived

deprived of

Deprivement

Depriver

Deprostrate

Deprovincialize

Depth

depth bomb

depth charge

depth finder

depth gage

depth gauge

Depth of a sail

depth psychology

**-- depth-first search --**

Depthen

Depthless

Depucelate

Depudicate

Depulse

Depulsion

Depulsory

Depurant

Depurate

Depuration

Depurative

Depurator

Depuratory

Depure

Depurgatory

Depurition

Deprive

deprived

deprived of

Deprivement

Depriver

Deprostrate

Deprovincialize

Depth

depth bomb

depth charge

depth finder

depth gage

depth gauge

Depth of a sail

depth psychology

Depthen

Depthless

Depucelate

Depudicate

Depulse

Depulsion

Depulsory

Depurant

Depurate

Depuration

Depurative

Depurator

Depuratory

Depure

Depurgatory

Depurition