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.
算法采用了深度优先挖掘策略，并将基于前缀序列格的深度优先遍历与两种高效的剪枝策略相结合。
As you can see, the file traversal is depth first but not necessarily in any alphabetical order within a directory.
正如您所见到的，该文件是深度优先遍历，但不一定在任何目录内按字母顺序来进行。
应用推荐