图的建立与遍历算法。
c语言些的程序，数据结构中图的遍历算法实现。
C language of some of the procedures, the data structure in graph traversal algorithm.
其次，本文提出了基于树结构的未知环境遍历算法。
Secondly, we give an ergodicity algorithm to unknown environment as tree structure.
清单3是对清单2的改写，它使得树的遍历算法更明显。
Listing 3 is a rewrite of Listing 2 that makes the tree walking more explicit.
提出移动机器人的一种新的完全遍历算法：矩形分解算法。
A new cellular decomposition approach, rectangular decomposition, is proposed for the purpose of complete coverage path planning.
后一个补丁包含对将来补丁中不同的“跳跃式”队列遍历算法的识别和支持。
This later patch contains a reorganization to support a different "skipping" queue traversal algorithm of the queue with future patches.
首先，通过大量的文献阅读，总结了现有遍历算法和移动物体检测算法。
Firstly, review a lot of relevant papers and conclude recent ergodicity algorithm and algorithm of detecting moving objects.
基于图的遍历算法，提出和实现了对于SD-RT算法的几种改进方法。
Proposed and implemented several methods to improve the SD-RT algorithm with the graph traverse algorithm.
简单图遍历算法已经非常成熟，但是还没有完善的冗余拓扑图遍历算法。
The traversing algorithm for the simple graph has been researched for many years and lots of mature algorithms are developed.
首先给出分段开关对等相关定义，提出基于深度优先的分段开关对遍历算法。
The definition of coupled-switches (CS) and the traversal algorithm for CSs using the depth-first method are proposed.
使得特性检查在业界获得成功的因素是象征遍历算法，它无保留地枚举状态空间。
What makes property checking a success in industry are symbolic traversal algorithms that enumerate the state space implicitly.
编写一个一趟遍历算法，并且只使用o(1)的额外空间来确定路径是否自相交。
Write a one-pass algorithm with o (1) extra space to determine, if your path crosses itself, or not.
提出一种能灵活响应配电网络拓扑结构变化的复杂辐射状配电系统可靠性评估的故障遍历算法。
A new reliability evaluation algorithm for complex radial distribution system is proposed to respond to the changes of distribution network topologies.
注意，这个缓存对于您使用的特定遍历算法并不真正需要，我在这里使用它只是为了展示当您将来需要扩展这个工具时应该怎样做。
Note the caching is not really required for the particular traversal algorithm you are using, but I leave it in to show how to do this if it is needed as you expand this tool in the future.
针对移动平台上大量的简单3d物体实时碰撞检测效率不高的问题，文中提出了以构建碰撞树为基础的碰撞遍历算法。
Aimed at the low efficiency of real-time collision detection problem of simple 3d object on mobile platforms, this paper proposes a recursion detection algorithm using collision tree.
本文提出的方法在目的端利用获得的中间节点位置信息来生成无向图，再利用广度优先遍历算法BFS计算出另外一条不相交路径。
This method USES intermediate nodes' location information to create undirected graph at destination node, and USES Breath-First Search (BFS) algorithm to find another disjoint path.
算法也同样重要，从二分查找到各种排序，到图形遍历，一位明星工程师必须知道并内在消化这些基础东西。
And the algorithms are just as important - from binary search to different sorts to graph traversals, a rockstar engineer must know and internalize the basics.
这里使用的算法首先沿着来自实例元素的父轴向后遍历，直到遇见一个全局元素。
Here, the algorithm used first traverses back along the parent axis from this instance element all the way to an element that is found to be a global element.
对输入树进行深度优先的遍历，这和您在编程101中所学的深度优先算法没有什么不同。
Performs a depth-first walk of the input tree, this is the same depth-first algorithm you learned in programming 101.
这对于 best-fit算法非常有用，可以用来查找最适合所需要的分配大小的缓存（遍历列表）。
This is useful for best-fit algorithms that look for a cache that most closely fits the size of the desired allocation (iterating the list).
另外，基于如路径-查询(Path - Search)算法的普通图，也易于通过遍历图来实现。
Additionally common graph based algorithms like path-searches are easy to implement by traversing through the graph.
这是数据结构的一个遍历的简单算法，希望对初学者有所帮助。
This is the data structure of a simple traversal algorithm, and they hope to be helpful to beginners.
在isFactor()和factorsOf()方法中，我停止了对框架循环算法的控制 —它决定如何通过最好的方式遍历所有数字。
In the isFactor() and factorsOf() methods, I cede control of the looping algorithm to the framework — it now decides how best to iterate over the range of numbers.
但是向后移动要复杂些，因为迭代器内部执行的是深度优先算法，预先排好了Rope遍历的顺序，需要访问每个叶节点。
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.
在遍历查询表达式时，算法可能需要纠正双重否定。
As you iterate over the query expressions, your algorithm may need to correct for double negatives. Consider a query expression like this one.
该算法充分利用混沌的初值敏感性和轨道遍历性，克服了已有混沌变异模型存在搜索盲区大的缺点。
The algorithm makes fully use of initial value sensitivity and track ergodicity of chaos, overcoming the disadvantage of big searching dead zone existed in conventional chaotic mutation model.
前序遍历的递归算法如何回到父母吗？
How does the recursion preorder traversal algorithm go back to parent?
一些数据结构的基本算法，例如树，图的遍历等。
Some of the basic algorithm for data structure, such as trees, graph traversal and so on.
特别，跟传统自动机不同的是，新算法的极限行为同时兼具吸收壁和遍历性。
Especially, as opposed to the traditional automata, the limiting behavior of the proposed algorithm possesses both absorbing barriers and ergodicity.
特别，跟传统自动机不同的是，新算法的极限行为同时兼具吸收壁和遍历性。
Especially, as opposed to the traditional automata, the limiting behavior of the proposed algorithm possesses both absorbing barriers and ergodicity.
应用推荐