Search Result for "depth-first search":
perl: warning: Please check that your locale settings:
	LANGUAGE = (unset),
	LC_ALL = (unset),
	LC_TIME = "tr_TR.UTF-8",
	LC_MONETARY = "tr_TR.UTF-8",
	LC_ADDRESS = "tr_TR.UTF-8",
	LC_TELEPHONE = "tr_TR.UTF-8",
	LC_NAME = "tr_TR.UTF-8",
	LC_MEASUREMENT = "tr_TR.UTF-8",
	LC_IDENTIFICATION = "tr_TR.UTF-8",
	LC_NUMERIC = "tr_TR.UTF-8",
	LC_PAPER = "tr_TR.UTF-8",
	LANG = "C"
    are supported and installed on your system.
perl: warning: Falling back to the standard locale ("C").
1 definitions retrieved:

The Free On-line Dictionary of Computing (18 March 2015):

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)