الإنجليزية - الإنجليزية
تعريف depth-first في الإنجليزية الإنجليزية القاموس.
- depth-first search
- an algorithm for traversing a tree or graph where one starts at the root nad explores as far as possible along each branch before backtracking
- depth-first search
- Depth-first search (DFS) is an algorithm for traversing or searching a tree, tree structure, or graph. Intuitively, one starts at the root (selecting some node as the root in the graph case) and explores as far as possible along each branch before backtracking. Formally, DFS is an uninformed search that progresses by expanding the first child node of the search tree that appears and thus going deeper and deeper until a goal node is found, or until it hits a node that has no children. Then the search backtracks, returning to the most recent node it hadn't finished exploring. In a non-recursive implementation, all freshly expanded nodes are added to a LIFO stack for exploration