Depth First Search

Views Updated: Dec 15, 2025

Key Facts

Abbreviation
DFS
Pronunciation
/dɛpθ fərst sərʧ/
Category
Computing
Related Field
General

Examples in Context

  1. According to this hybrid trust model, it presents an algorithm constructing a path base on a depth first search, and summarizes the path validation algorithm.
  2. A method to mark transitive predecessors and transitive successors by using depth first search is provided with a description of the algorithm based on stack.
  3. A heuristic depth first search, on the other hand, uses some heuristic function to determine which of the nodes is the most promising.
  4. Degree - based tabu list in the algorithm based on depth first search is introduced to obtain connected trees.
  5. A hybrid algorithm combined with dynamic programming and the lower bound ( or upper bound ) algorithm is proposed. It is on the basis of analysing the depth first search ( DFS ) and the breadth first search ( BFS ) methods.

Other meanings of DFS