查询词典 graph

This paper emploies a collection of discrete and limit topological events which simulates topological changes of Delaunay diagrams,the dual graph of Voronoi diagrams,to realize maintaining Voronoi diagrams of moving points.

通过一组离散的，有限的事件序列对其对偶图Delaunay图拓扑改变过程的模拟来实现对移动点Voronoi图拓扑结构的维护。

However it allows edges or elements to straddle between subdomains. In order to be used in conjunction with element-based Godunov algorithm, the RSB algorithm partitions the dual graph of the computational meshes, e.g.

为了将递归谱对分法与以单元为主的Godunov方法结合使用，本文将该方法用于Delaunay非结构网格的对偶图Voronoi图，然后再根据Voronoi图中的结点与Delaunay网格中的三角形单元之间的一一对应关系，得到Delaunay网格的分区。

Based on the triangulation of the state space of a robot, a dual graph was constructed following the target attractive principle, and then a path planning algorithm was presented to find a sequence of adjacent triangles that were traversed by the shortest path.

对机器人的状态空间进行三角划分，根据目标吸引原理来建立其对偶图，针对对偶图提出路径规划算法得到最短路径穿越的三角形序列。

Firstly,a node-based topology relationship model of transport network is presented,in which the physical connection and the logical connection are described.Secondly,the structure of search node is defined in the sight of dual graph theory as a solution for turn prohibitions and delays in road intersections.

提出了基于节点的交通网络拓扑关系模型，描述交通网络的物理连通性以及逻辑连通性；根据对偶图的思想，定义搜索节点结构，处理交叉口转向限制和延误；改进传统的Dijkstra算法，提出了基于搜索节点的双向启发式A*算法，使用二叉堆优先级队列存储扩展节点，RB-tree存储标记节点。

Duality principle ; DC DC converter ; directed topological graph

对偶原理；直流；直流变换器；有向拓扑图。

In this case the node cannot store any dynamic data in member variables but instead all dynamic data must be stored in the character entity or in the dynamic part of the animation graph.

在这种情况下，节点不能存储动态数据的任何成员变量，而是所有动态数据必须存储在字符实体或在动态部分动画图

Features includes: Relative Signal Bar Graph, RF Gain Control, Headphone Input, On/Off Control and earplug.

功能包括：相对信号条形图，射频增益控制，耳机的投入，通/断控制和耳塞。

We know that edge connectivity plays an importent role in the connectivity of graph.

我们知道，边连通度是反映图的连通性质的一个重要参数。

The restricted edge connectivity problem of graphs and some other graph theories are all from the study of the big network design and reliability analysis.

图的限制性边连通度问题及许多理论都是源自大型网络的设计和可靠性分析。

Several of the graph problems we have discussed in this book can be modeled as network flow, including bipartite matching, shortest path, and edge/vertex connectivity.

一些图的问题我们已经讨论过这本书可以作为网络流模型，包括双边匹配，最短路径，和EDGE /顶点连接。

As she looked at Warrington's manly face, and dark, melancholy eyes, she had settled in her mind that he must have been the victim of an unhappy attachment.

每逢看到沃林顿那刚毅的脸，那乌黑、忧郁的眼睛，她便会相信，他一定作过不幸的爱情的受害者。

Maybe they'll disappear into a pothole.

也许他们将在壶穴里消失