所谓遍历(Traversal),是指沿着某条搜索路线,依次对树(或图)中每个节点均做一次访问。访问结点所做的操作依赖于具体的应用问题, 具体的访问操作可能是检查节点的值、更新节点的值等。不同的遍历方式,其访问节点的顺序是不一样的。遍历是二叉树上最重要的运算之一,是二叉树上进行其它运算之基础。当然遍历的概念也适合于多元素集合的情况,如数组。
n. traverse ; traversal ; ergodicity
adj. ergodic
遍历假设 ergodic hypothesis
中序遍历 Inorder traversal ; LDR ; void inorder ; inorder tree walk
遍历器 Iterator
后序遍历 LRD ; void postorder ; postorder ; void LaOrder
遍历匹配集合 For Each Match in Matches
前序遍历 DLR ; void preorder ; ABDECF ; PreOrder
遍历假说 [数] ergodic hypothesis
遍历变换 [数] ergodic transformation
遍历态 [数] ergodic state
The paper studies a new type Full-areaObstacle avoidance, namely full-area coverage.
本文研究了一种新型的完全遍历路径规划,使机器人无遗漏地覆盖整片工作区域,同时能自主避开障碍。
参考来源 - 壁面爬行机器人设计及路径规划研究In chapter 4, we consider the ergodic properties of group actions.
第四章,考虑离散群作用的遍历性问题。
参考来源 - 离散群作用的几点动力性质·2,447,543篇论文数据,部分数据来源于NoteExpress
我要定义一个类,特别要做的是,遍历它所表示的内容。
I'm going to define a class, and in particular, what I'm going to do, is to walk through what that says.
如果不是由于这个小小的优化,我们将遍历每个元素两次。
If not for this small optimization, we would go through every element twice.
您必须遍历不相关事件的日志,以找到所需的内容,这在活动服务器上可能很棘手。
You have to go through logs of unrelated events to find what you need, which can be a nightmare on a live server.
You'll also notice that this thing goes through the entire list, even if the list is sorted before it gets partway through.
你也能注意到,它始终会遍历列表,甚至列表在排序之前,就是有序的也是这样。
And because, as long as this collection is finite, this thing is just going to walk through. All right?
这个操作就会遍历完它的,对不对?,那么,如果我给大家看看,例如?
In other words it doesn't just return when it finds one, it's going to run through all of them. All right?
但是它将会继续运行,换句话来说当它找到一个结果时,它不会立刻返回结果它会先遍历所有的内容?
应用推荐