depth-first search [计] 深度优先搜索 ; 深度优先搜寻
Depth first search 深度优先搜索 ; 深度优先搜寻 ; 深度优先
depth-first search tree 深度优先搜索树
breadth-and-depth-first search 宽度与深度优先搜索
Depth-first search method 与传统的深度优先算法
depth-first search program [计] 深度优先搜索程序
breadth-and depth-first search [计] 宽度优先和深度优先搜索
depth-first search Binary Tree 说明深度优先搜索二叉树
As you can see if you compare Listings 2 and 3, the processor takes care of much of the basic coding (such as looping and passing parameters) to implement a depth-first search.
通过比较清单2和清单3，可以看出处理程序处理了很多基本代码(比如循环和传递参数)，以便实现深度优先的搜索。
The basic idea of the algorithm is this: a depth-first search begins from an arbitrary start node (and subsequent depth-first searches are conducted on any nodes that have not yet been found).
基本思想是：从任意一个结点出发深搜（后续的深搜要在未访问过的结点上进行）。
The algorithm adopts a hierarchical structure in knowledge rule while the breadth and depth, first search is integrated in reasoning strategy.
该算法应用的知识规则采用分层结构，在推理策略上综合应用深度和广度优先搜索。
应用推荐