depth-first search

(redirected from DFS algorithm)

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 ?
The DFS algorithm is executed once for each flow and paths are recalculated only after each topology changes.
algorithm, DFS algorithm and BFS algorithm are all ergodic algorithm of virtual state environment.
Step 1: find all simple paths from initial node to final node in the project network using DFS algorithm.
All possible simple paths in the project network from initial node to final node are calculated using DFS algorithm.
Example of a "Give an example" task Example 1: Execute DFS algorithm on a given graph, and find the resulting DFS tree.
Proof The proof of Lemma 1 is rather easy due to the property of the DFS algorithm, we omit it for brevity.
A modified DFS algorithm has been provided for this purpose.
A modified DFS algorithm can be used for the generation of normalized path-set.
The modified DFS tree generation algorithm proposed in this paper basically follows the nomenclature of the original DFS algorithm as given in [12].
In section 3, the HMM-based channel prediction and DFS algorithm are detailed.
Proposed DFS algorithm with HMM-based channel prediction
Therefore, devices with certified DFS algorithms can miss detecting weather radar signals, for example, from TDWRs (Carroll et al.