The root node is simply the first node of the strongly connected component which is encountered during the depth-first traversal.
这个根结点是在深搜时碰到当前强连通分量的第一个结点。
The search strategy of our algorithm integrates a depth-first traversal of the prefix sequence lattice with two effective pruning mechanisms.
算法采用了深度优先挖掘策略，并将基于前缀序列格的深度优先遍历与两种高效的剪枝策略相结合。
Then, dynamic optimized the orders of service process by parthenogenetic algorithm in the process of depth-first traversal of the process tree.
通过深度优先遍历流程树，利用单亲遗传算法对流程效劳停止优化组合。
As you can see, the file traversal is depth first but not necessarily in any alphabetical order within a directory.
正如您所见到的，该文件是深度优先遍历，但不一定在任何目录内按字母顺序来进行。
This results in breadth-first traversal (compared to digging down into the first link found, which would result in depth-first behavior).
这会产生广度优先遍历（与优先处理首先找到的第一个链接不同，后者是一种深度优先遍历）。
But moving backward is more complicated, because internally the iterator performs a depth-first, preorder traversal of the Rope, visiting each of its leaf nodes.
但是向后移动要复杂些，因为迭代器内部执行的是深度优先算法，预先排好了Rope遍历的顺序，需要访问每个叶节点。
In these foundations, the recursion theory of depth first traversal, database technology and visual programming technology are employed to computer memory, which is expressed to node relations.
在此基础上，采用深度优先遍历的递归理论和数据库技术，实现了流域节点间关系的计算机存储。
The definition of coupled-switches (CS) and the traversal algorithm for CSs using the depth-first method are proposed.
首先给出分段开关对等相关定义，提出基于深度优先的分段开关对遍历算法。
Connectivity to the map without the depth and breadth - first traversal.
实现连通无向图的深度和广度优先遍历。
Connectivity to the map without the depth and breadth - first traversal.
实现连通无向图的深度和广度优先遍历。
应用推荐