The experimental results show that DFFCI outperforms other depth-first search algorithms.
实验结果表明该算法的性能优于其他主流深度优先算法。
There are two common approaches to searching a graph: depth-first search and breadth-first search.
有两种常用的方法可以用来搜索图：即深度优先搜索和广度优先搜索。
In the inference engine section, target-drive control, depth-first search and breadth-first search are adopted.
在推理机的设计中采用了目标驱动控制，以及深度优先搜索和广度优先搜索这两种搜索策略；
Using graph theory of adjacency matrix as a conversion, a depth-first search to the entire map, can be cut at all possible paths.
利用图论中的邻接矩阵作为转换点，深度优先搜索整个有向图，可以得到所有可能的切分形式。
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).
基本思想是：从任意一个结点出发深搜（后续的深搜要在未访问过的结点上进行）。
SEARCH DEPTH first must be specified if all child data (over all levels) must be returned first before returning the data of the next parent.
如果必须在返回下一个父数据的数据之前返回所有的子数据(所有级别上)，则必须指定SEARCH DEPTH FIRST。
The algorithm adopts a hierarchical structure in knowledge rule while the breadth and depth, first search is integrated in reasoning strategy.
该算法应用的知识规则采用分层结构，在推理策略上综合应用深度和广度优先搜索。
The shortest path problem in complex networks and graphs can be easily solved by labeling the distance between current point and start point during depth- first- search.
采用深度优先搜索法，文章首次提出了在搜索过程中采用标记距离的算法，有效地求解复杂网络和图的最短距离问题。
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.
以深度优先搜索作为基本算法，用路径删除和结点删除方法产生多重解，用最小成本法求出最优解。
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.
针对该信任模型，提出一种深度优先搜索的路径构建算法，并对路径验证算法进行了概述。
First, the search depth is not ideal. Search engines obtain information on Internet via web crawler, so they cannot get the Shared information stored in users' personal computer.
第一是搜索深度不够，当前搜索引擎通过网络蜘蛛获取互联网上的资源，无法检索用户个人电脑上的共享资源。
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.
给出了先序活动和后序活动的基本定义，讨论了运用深度优先搜索进行先序活动和后序活动标定的基本原理，提出了基于堆栈机制的标定算法。
The search strategy of our algorithm integrates a depth-first traversal of the prefix sequence lattice with two effective pruning mechanisms.
算法采用了深度优先挖掘策略，并将基于前缀序列格的深度优先遍历与两种高效的剪枝策略相结合。
The search strategy of our algorithm integrates a depth-first traversal of the prefix sequence lattice with two effective pruning mechanisms.
算法采用了深度优先挖掘策略，并将基于前缀序列格的深度优先遍历与两种高效的剪枝策略相结合。
应用推荐