图遍历

这是一种新型表达式语言，拥有优秀的集合、对象图遍历和索引支持功能。

This is the newer form of expression languages and has excellent collection , object graph traversal , and indexing support .

根据零件的孔、槽等剖切特征，提出基于优先度和基于图遍历的两种自动搜索关键特征产生剖切线的算法，并分别结合实例进行了比较。

This paper proposes two algorithms based on priority analysis and graph traversal respectively to automatically choose the section cut of key features such as holes and slots .

与本文中所采用的方法类似，路线图遍历了一个典型Systemz开发项目的所有阶段（先启，精化，构建和产品化）。

Similar to the approach taken in this article , the roadmap walks through each phase ( Inception , Elaboration , Construction , and Transition ) of a typical System z development project .

一种有效的基于图遍历的加权序列模式挖掘算法

Efficient algorithm for mining weighted sequential patterns based on graph traversals

流形元覆盖系统的有向图遍历生成算法研究

Generation of cover system for numerical manifold in travel theory of the oriented graph

简单图遍历算法已经非常成熟，但是还没有完善的冗余拓扑图遍历算法。

The traversing algorithm for the simple graph has been researched for many years and lots of mature algorithms are developed .

在算法中，利用权支持度、可扩展模式和权频繁模式等概念，并通过剪枝操作和候选模式产生操作来实现算法对图遍历模式的挖掘，最后通过实验对算法的性能进行了验证。

In this algorithm , can realize to mine graph by pruning operation and producing operation according to some concepts such as weighted support degree , extensible mode and weighted frequent patterns , eventually , the experiments on performance of the algorithm was verified .

该算法在生成初始种群时综合了Dijkstra算法和图的遍历算法的思想，提高初始种群的质量，保证个体路径有效性。

The algorithm combines Dijkstra algorithms , traverse algorithm thinking to design the initial population , which can ensure the effectiveness of individual paths to improve the quality of initial population .

图的遍历的分析与算法设计

Analysis and algorithm design of graph visiting

软件平台还应用图论的理论实现配置的逻辑图的遍历和保存，生成可编程逻辑文件。

Besides , the graph theory was applied to realize traversal and preservation of logic graph on the platform and form programmable scheme logic file .

对邻接矩阵在图的遍历、最小生成树、拓扑排序和关键路径等算法分析上的应用作了一定的探讨。

This paper discusses the application of adjacency matrix at the algorithm 's analysis for traversing Graph , Minimum cost Spanning Tree , Topological sort and Critical Path .

该技术对程序的控制流图进行遍历，寻找谓词执行的候选块，再根据图中节点的依赖关系对候选块进行谓词化操作。

Such technique traverses the control flow graph of the program , finds candidate block of predicated execution , and predicates the candidate blocks according to the dependency relationship between them .

通过将表面检测问题转化为有向图的遍历问题，简化了原先非常复杂的三维边界检测算法；

By a translation of the 3D boundary detection problem into a special directed graph traversal problem , we have been able to simplify the complexity of true 3D surface detection problem .

然后运用图论方法，通过对图的遍历找出其全部敏化通路（1通路），所有能到达原始输出端的1通路，其相应的故障均可得到检测。

All sensitized paths ( called 1 paths ) are identified by traversing the conditional digraph using graph-theoretical methods . All faults on 1 paths reachable to the primary outputs of the digital system can be detected .

二叉有向图及其路径遍历算法

The Binary Directed Graph and Its Path Traversal Algorithm

通过在模型图上的遍历算法，找到所有正确路径。这些路径便是指导服务编排的动词序列。

By traversing on the model map , we can find out all correct paths , which rightly indicate the verb sequence to direct service orchestration .

图的深度优先遍历的C语言实现

The C Language of Depth - First Ergodicity Of Graph

有向图的先深遍历与显示

Depth first searching method and display of the vector graph

对图的概念和遍历方法进行了简单的阐述。

This article briefly illustrates the concept of graph and searching method .

图的连通分支遍历算法在材料信息处理中的应用

Apply Traversing Branch of Graph in Processing Material Information

寻找λ-边连通子图的一次遍历搜索算法

Finding λ Edge-connected Subgraph of a Traversal Search Algorithms

舞蹈动作生成时，首先构建用于检索动作片段的动作图，然后通过遍历动作图为每个音乐片段选取符合映射条件的动作片段，最后在时间序列上将音乐片段与动作片段进行合成处理。

When dance motions generate , system construct the motion graph for searching the motion segment , then system select motion segment that matches the mapping condition for each music segment through searching the motion graph , finally system synthetize music segment and motion segment on the time sequence .

动态组件依赖图先被转化成无序标签树，然后借鉴图的宽度优先遍历方法，设计了一种线性时间复杂度的匹配算法。

For the dynamic CDG matching , we first transform the CDG into the disordered label trees , and then design a matching algorithm with linear time complexity for the label tree based on the idea of breadth first search graph algorithm .

该算法的核心是用Riemann图建立散乱测点间的邻接关系，在此基础上进行Riemann图的最优遍历并计算测点处的最小二乘拟合平面，从而近似计算删除一点引起的误差。

The key steps in the algorithms are establishing Riemann graph to represent the neighborhood relationship among sample points , traversing the Riemann graph in optimized way and calculating the least square fitting planes at the sample points .