depth-first

基本解释

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.
本文分析了深度优先搜索方法 (DFS)和广度优先搜索 (BFS)方法的特点 ,提出了一种混合使用动态规划方法和下界 (上界 )算法的精确求解方法求解组合优化问题。
By making use of these rules, graph's depth first search recursive algorithm and n-order Legendre polynomial recursive algorithm are (converted) to equivalent non-recursive algorithms.
利用该组规则将图的深度优先搜索(DFS)和n阶勒让德多项式的递归算法转换成了等价的非递归算法.
Combined with AI theory, an algorithm for recognizing the energized state of telecontrol system of electric railway feeding lines is proposed based on a heuristic depth first search approach.
算法实现了牵引供电远动系统线路带电推导，对该算法进行了理论分析，并给出了实现该算法的控制策略及软件框图。
depth first left most ergodic algorithm
深度优先最左遍历
cout 广度优先遍历意思是先访问兄弟再访问孩子，深度优先遍历先访问孩子再访问兄弟。