depth-first search

(redirected from Depth first search)

depth-first search

(algorithm)
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.
References in periodicals archive ?
This paper is therefore limited to comparing the implementations of the popular AI algorithms, namely Breadth First Search, Depth First Search, A*, Best First Search and Hill climbing algorithms for solving a sliding n-puzzle in an attempt to look at the better efficient of the algorithms for this case.
discussed a study on Depth First search as asymptotically optimal exponential tree searches [5].
This paper attempts to demonstrate the implementation of Breadth First Search, Depth First Search, A*, Best First Search and Hill Climbing algorithms for solving a sizeable sliding puzzle and for solving an 8 queen puzzle.
There are 5 different search algorithms that are explored in this paper, namely the Breadth First Search, Depth First Search, A*, Best First Search and Hill Climbing.
The Depth First Search algorithm shares the similar mode for Goal identification and Search Tree traversal, but not in its motion of expansion.
The values of Depth first search has been avoided in the chart since the value is well out of range.
Depth first search is similar to breadth first search.
In the diagram for Depth first search (figure 12), there are three examples given ach with a different initial queen.
Breadth First Search, Depth First Search and Best First Search can only generate one board which same each time it is run.
Algorithm for connectivity of graph (include Breadth First Search and Depth First Search, adjacency matrix and genetic algorithm are all popular methods adopted to judge pathway connectivity [1].