...DFS-Depth First Search-深度优先搜索 对于一颗二叉树，深度优先搜索（Depth First Search）是沿着树的深度遍历树的结点，尽可能深的搜索数的分支。先访问根结点，然后遍历左子树接着是遍历右子树。
基于116个网页-相关网页
深度优先搜寻(Depth First Search) 深度优先搜寻(Depth-first search) 的作法则是由最近展开的节点 中,展开其子节点,再考虑节点的子节点,如果达到一个端点而...
基于76个网页-相关网页
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 深度优先搜索
depth-first search Binary Tree 说明深度优先搜索二叉树
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.
给出了先序活动和后序活动的基本定义，讨论了运用深度优先搜索进行先序活动和后序活动标定的基本原理，提出了基于堆栈机制的标定算法。
Based on depth first search, the article USES route deletion and node deletion methods to produce multi-solutions, and then determine the optimum solution with least costing.
以深度优先搜索作为基本算法，用路径删除和结点删除方法产生多重解，用最小成本法求出最优解。
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，可以看出处理程序处理了很多基本代码(比如循环和传递参数)，以便实现深度优先的搜索。
应用推荐